/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:10:07,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:10:07,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:10:07,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:10:07,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:10:07,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:10:07,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:10:07,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:10:07,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:10:07,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:10:07,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:10:07,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:10:07,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:10:07,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:10:07,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:10:07,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:10:07,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:10:07,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:10:07,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:10:07,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:10:07,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:10:07,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:10:07,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:10:07,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:10:07,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:10:07,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:10:07,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:10:07,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:10:07,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:10:07,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:10:07,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:10:07,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:10:07,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:10:07,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:10:07,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:10:07,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:10:07,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:10:07,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:10:07,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:10:07,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:10:07,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:10:07,382 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:10:07,396 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:10:07,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:10:07,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:10:07,398 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:10:07,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:10:07,398 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:10:07,399 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:10:07,399 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:10:07,399 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:10:07,399 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:10:07,399 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:10:07,399 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:10:07,400 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:10:07,400 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:10:07,400 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:10:07,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:10:07,400 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:10:07,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:10:07,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:10:07,401 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:10:07,401 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:10:07,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:10:07,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:10:07,401 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:10:07,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:10:07,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:10:07,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:10:07,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:10:07,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:10:07,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:10:07,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:10:07,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:10:07,586 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:10:07,586 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:10:07,587 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:10:07,678 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_m64GJY/tmp/ce35c1d286de4ec7b5545b6e4709ce85/FLAGd552636fc [2020-07-01 13:10:08,014 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:10:08,015 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:10:08,015 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:10:08,022 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_m64GJY/tmp/ce35c1d286de4ec7b5545b6e4709ce85/FLAGd552636fc [2020-07-01 13:10:08,449 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_m64GJY/tmp/ce35c1d286de4ec7b5545b6e4709ce85 [2020-07-01 13:10:08,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:10:08,462 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:10:08,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:10:08,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:10:08,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:10:08,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644a65e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08, skipping insertion in model container [2020-07-01 13:10:08,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:10:08,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:10:08,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:10:08,728 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:10:08,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:10:08,760 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:10:08,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08 WrapperNode [2020-07-01 13:10:08,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:10:08,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:10:08,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:10:08,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:10:08,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:10:08,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:10:08,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:10:08,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:10:08,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:10:08,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:10:08,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:10:08,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:10:08,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:10:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:10:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:10:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:10:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:10:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:10:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:10:09,227 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:10:09,227 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-01 13:10:09,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09 BoogieIcfgContainer [2020-07-01 13:10:09,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:10:09,233 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:10:09,233 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:10:09,237 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:10:09,238 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,255 INFO L313 BlockEncoder]: Initial Icfg 73 locations, 80 edges [2020-07-01 13:10:09,257 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:10:09,257 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:10:09,258 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:10:09,258 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:10:09,260 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:10:09,261 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:10:09,261 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:10:09,290 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:10:09,332 INFO L200 BlockEncoder]: SBE split 39 edges [2020-07-01 13:10:09,337 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:10:09,339 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:10:09,368 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 13:10:09,370 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 13:10:09,372 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:10:09,373 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:10:09,377 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 13:10:09,377 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:10:09,378 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:10:09,378 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:10:09,379 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:10:09,379 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:10:09,380 INFO L313 BlockEncoder]: Encoded RCFG 61 locations, 110 edges [2020-07-01 13:10:09,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:10:09 BasicIcfg [2020-07-01 13:10:09,380 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:10:09,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:10:09,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:10:09,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:10:09,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:10:08" (1/4) ... [2020-07-01 13:10:09,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c371bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:10:09, skipping insertion in model container [2020-07-01 13:10:09,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (2/4) ... [2020-07-01 13:10:09,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c371bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:10:09, skipping insertion in model container [2020-07-01 13:10:09,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09" (3/4) ... [2020-07-01 13:10:09,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c371bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:10:09, skipping insertion in model container [2020-07-01 13:10:09,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:10:09" (4/4) ... [2020-07-01 13:10:09,389 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:10:09,400 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:10:09,408 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2020-07-01 13:10:09,422 INFO L251 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2020-07-01 13:10:09,446 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:10:09,447 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:10:09,447 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:10:09,447 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:10:09,447 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:10:09,447 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:10:09,447 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:10:09,448 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:10:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-07-01 13:10:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:09,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:09,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:09,471 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash 179701, now seen corresponding path program 1 times [2020-07-01 13:10:09,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:09,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483743961] [2020-07-01 13:10:09,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:09,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483743961] [2020-07-01 13:10:09,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:09,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:09,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077555395] [2020-07-01 13:10:09,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:09,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:09,670 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2020-07-01 13:10:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:09,839 INFO L93 Difference]: Finished difference Result 120 states and 211 transitions. [2020-07-01 13:10:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:09,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:09,854 INFO L225 Difference]: With dead ends: 120 [2020-07-01 13:10:09,854 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 13:10:09,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 13:10:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-01 13:10:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-01 13:10:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2020-07-01 13:10:09,899 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 3 [2020-07-01 13:10:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:09,900 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2020-07-01 13:10:09,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2020-07-01 13:10:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:09,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:09,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:09,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:10:09,902 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash 179639, now seen corresponding path program 1 times [2020-07-01 13:10:09,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:09,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495363958] [2020-07-01 13:10:09,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:09,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495363958] [2020-07-01 13:10:09,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:09,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:09,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360520494] [2020-07-01 13:10:09,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:09,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:09,966 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2020-07-01 13:10:10,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,114 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2020-07-01 13:10:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,116 INFO L225 Difference]: With dead ends: 61 [2020-07-01 13:10:10,116 INFO L226 Difference]: Without dead ends: 54 [2020-07-01 13:10:10,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-01 13:10:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-01 13:10:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 13:10:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 89 transitions. [2020-07-01 13:10:10,124 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 89 transitions. Word has length 3 [2020-07-01 13:10:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,124 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 89 transitions. [2020-07-01 13:10:10,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 89 transitions. [2020-07-01 13:10:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:10,125 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:10,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:10:10,126 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 179641, now seen corresponding path program 1 times [2020-07-01 13:10:10,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287703132] [2020-07-01 13:10:10,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287703132] [2020-07-01 13:10:10,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696008647] [2020-07-01 13:10:10,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,158 INFO L87 Difference]: Start difference. First operand 54 states and 89 transitions. Second operand 3 states. [2020-07-01 13:10:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,272 INFO L93 Difference]: Finished difference Result 61 states and 89 transitions. [2020-07-01 13:10:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,274 INFO L225 Difference]: With dead ends: 61 [2020-07-01 13:10:10,274 INFO L226 Difference]: Without dead ends: 54 [2020-07-01 13:10:10,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-01 13:10:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-01 13:10:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 13:10:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2020-07-01 13:10:10,281 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 3 [2020-07-01 13:10:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,281 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2020-07-01 13:10:10,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2020-07-01 13:10:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:10,282 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:10,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:10:10,283 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash 179642, now seen corresponding path program 1 times [2020-07-01 13:10:10,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878251429] [2020-07-01 13:10:10,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878251429] [2020-07-01 13:10:10,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95780729] [2020-07-01 13:10:10,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,334 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand 3 states. [2020-07-01 13:10:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,452 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2020-07-01 13:10:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,454 INFO L225 Difference]: With dead ends: 54 [2020-07-01 13:10:10,454 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 13:10:10,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 13:10:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 13:10:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 13:10:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 75 transitions. [2020-07-01 13:10:10,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 75 transitions. Word has length 3 [2020-07-01 13:10:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,460 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 75 transitions. [2020-07-01 13:10:10,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 75 transitions. [2020-07-01 13:10:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:10:10,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:10:10,462 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash -107326127, now seen corresponding path program 1 times [2020-07-01 13:10:10,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766503066] [2020-07-01 13:10:10,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766503066] [2020-07-01 13:10:10,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:10:10,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962154536] [2020-07-01 13:10:10,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,493 INFO L87 Difference]: Start difference. First operand 47 states and 75 transitions. Second operand 3 states. [2020-07-01 13:10:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,618 INFO L93 Difference]: Finished difference Result 101 states and 165 transitions. [2020-07-01 13:10:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 13:10:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,640 INFO L225 Difference]: With dead ends: 101 [2020-07-01 13:10:10,640 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 13:10:10,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 13:10:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2020-07-01 13:10:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 13:10:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 77 transitions. [2020-07-01 13:10:10,647 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 77 transitions. Word has length 8 [2020-07-01 13:10:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,648 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 77 transitions. [2020-07-01 13:10:10,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 77 transitions. [2020-07-01 13:10:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:10:10,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:10:10,649 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash -106402606, now seen corresponding path program 1 times [2020-07-01 13:10:10,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489791989] [2020-07-01 13:10:10,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489791989] [2020-07-01 13:10:10,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:10:10,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845284721] [2020-07-01 13:10:10,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,677 INFO L87 Difference]: Start difference. First operand 49 states and 77 transitions. Second operand 3 states. [2020-07-01 13:10:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,779 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2020-07-01 13:10:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 13:10:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,780 INFO L225 Difference]: With dead ends: 104 [2020-07-01 13:10:10,780 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 13:10:10,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 13:10:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2020-07-01 13:10:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 13:10:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2020-07-01 13:10:10,786 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 8 [2020-07-01 13:10:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,786 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2020-07-01 13:10:10,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2020-07-01 13:10:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:10:10,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:10:10,788 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,788 INFO L82 PathProgramCache]: Analyzing trace with hash -106401645, now seen corresponding path program 1 times [2020-07-01 13:10:10,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819234851] [2020-07-01 13:10:10,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819234851] [2020-07-01 13:10:10,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:10:10,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47010711] [2020-07-01 13:10:10,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,813 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 3 states. [2020-07-01 13:10:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,896 INFO L93 Difference]: Finished difference Result 95 states and 150 transitions. [2020-07-01 13:10:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 13:10:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,897 INFO L225 Difference]: With dead ends: 95 [2020-07-01 13:10:10,897 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 13:10:10,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 13:10:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2020-07-01 13:10:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:10:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2020-07-01 13:10:10,903 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 8 [2020-07-01 13:10:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,903 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2020-07-01 13:10:10,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2020-07-01 13:10:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:10:10,904 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:10:10,905 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -114314161, now seen corresponding path program 1 times [2020-07-01 13:10:10,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852826705] [2020-07-01 13:10:10,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852826705] [2020-07-01 13:10:10,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630547493] [2020-07-01 13:10:10,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,944 INFO L87 Difference]: Start difference. First operand 51 states and 77 transitions. Second operand 3 states. [2020-07-01 13:10:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:11,020 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2020-07-01 13:10:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:11,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:10:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:11,021 INFO L225 Difference]: With dead ends: 51 [2020-07-01 13:10:11,021 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 13:10:11,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 13:10:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 13:10:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 13:10:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2020-07-01 13:10:11,026 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 10 [2020-07-01 13:10:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:11,026 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2020-07-01 13:10:11,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2020-07-01 13:10:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:10:11,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:11,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:10:11,039 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:11,040 INFO L82 PathProgramCache]: Analyzing trace with hash -114314159, now seen corresponding path program 1 times [2020-07-01 13:10:11,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:11,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876606400] [2020-07-01 13:10:11,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:11,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876606400] [2020-07-01 13:10:11,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:11,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:11,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060749885] [2020-07-01 13:10:11,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:11,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:11,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,084 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 3 states. [2020-07-01 13:10:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:11,147 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2020-07-01 13:10:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:11,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:10:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:11,149 INFO L225 Difference]: With dead ends: 46 [2020-07-01 13:10:11,149 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 13:10:11,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 13:10:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 13:10:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:10:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2020-07-01 13:10:11,153 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 10 [2020-07-01 13:10:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:11,153 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2020-07-01 13:10:11,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2020-07-01 13:10:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:10:11,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:11,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:10:11,155 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash 827207181, now seen corresponding path program 1 times [2020-07-01 13:10:11,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:11,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356764413] [2020-07-01 13:10:11,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:11,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356764413] [2020-07-01 13:10:11,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:11,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:10:11,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805928625] [2020-07-01 13:10:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:11,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:11,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,180 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand 3 states. [2020-07-01 13:10:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:11,245 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2020-07-01 13:10:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:11,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:10:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:11,246 INFO L225 Difference]: With dead ends: 67 [2020-07-01 13:10:11,246 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 13:10:11,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 13:10:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 13:10:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:10:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2020-07-01 13:10:11,250 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 10 [2020-07-01 13:10:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:11,251 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-07-01 13:10:11,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2020-07-01 13:10:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 13:10:11,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:11,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:10:11,252 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1304434674, now seen corresponding path program 1 times [2020-07-01 13:10:11,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:11,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947089781] [2020-07-01 13:10:11,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:11,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947089781] [2020-07-01 13:10:11,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:11,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:11,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409537291] [2020-07-01 13:10:11,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:11,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:11,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:11,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,289 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 3 states. [2020-07-01 13:10:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:11,348 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-07-01 13:10:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:11,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-01 13:10:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:11,349 INFO L225 Difference]: With dead ends: 37 [2020-07-01 13:10:11,349 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:10:11,349 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:10:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 13:10:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 13:10:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2020-07-01 13:10:11,353 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2020-07-01 13:10:11,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:11,353 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2020-07-01 13:10:11,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-01 13:10:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 13:10:11,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:11,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:10:11,355 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1304434672, now seen corresponding path program 1 times [2020-07-01 13:10:11,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:11,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844371922] [2020-07-01 13:10:11,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:11,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844371922] [2020-07-01 13:10:11,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:11,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:11,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683489075] [2020-07-01 13:10:11,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:11,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,396 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2020-07-01 13:10:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:11,441 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-01 13:10:11,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:11,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-01 13:10:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:11,442 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:10:11,442 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:10:11,443 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:10:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:10:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:10:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:10:11,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-01 13:10:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:11,444 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:10:11,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:10:11,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:10:11,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:10:11,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:10:11,499 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:10:11,499 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 13:10:11,499 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,499 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,499 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:10:11,499 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:11,500 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:10:11,501 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:10:11,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:10:11,501 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 13:10:11,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,501 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,501 INFO L264 CegarLoopResult]: At program point L12-3(lines 12 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~z~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~z~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~z~0.base)) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point L9-2(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point L9-4(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,502 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point L9-5(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point L9-6(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point L9-7(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point L9-9(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point L9-10(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,503 INFO L268 CegarLoopResult]: For program point L9-11(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point L9-12(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point L9-14(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point L9-15(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point L9-16(lines 9 11) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:10:11,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 17) no Hoare annotation was computed. [2020-07-01 13:10:11,505 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:10:11,506 INFO L264 CegarLoopResult]: At program point L14-4(lines 14 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~z~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~z~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~z~0.base)) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 13:10:11,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,506 INFO L268 CegarLoopResult]: For program point L14-5(lines 14 17) no Hoare annotation was computed. [2020-07-01 13:10:11,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:11,509 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:10:11,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,520 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,520 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:11,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:11,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:11,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:11,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:10:11 BasicIcfg [2020-07-01 13:10:11,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:10:11,533 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:10:11,534 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:10:11,537 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:10:11,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:11,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:10:08" (1/5) ... [2020-07-01 13:10:11,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40011d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:10:11, skipping insertion in model container [2020-07-01 13:10:11,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:11,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08" (2/5) ... [2020-07-01 13:10:11,539 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40011d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:10:11, skipping insertion in model container [2020-07-01 13:10:11,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:11,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09" (3/5) ... [2020-07-01 13:10:11,539 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40011d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:10:11, skipping insertion in model container [2020-07-01 13:10:11,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:11,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:10:09" (4/5) ... [2020-07-01 13:10:11,540 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40011d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:10:11, skipping insertion in model container [2020-07-01 13:10:11,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:11,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:10:11" (5/5) ... [2020-07-01 13:10:11,541 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:10:11,562 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:10:11,562 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:10:11,562 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:10:11,563 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:10:11,563 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:10:11,563 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:10:11,563 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:10:11,563 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:10:11,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states. [2020-07-01 13:10:11,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 13:10:11,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:10:11,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:10:11,579 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,579 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,579 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:10:11,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states. [2020-07-01 13:10:11,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 13:10:11,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:10:11,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:10:11,582 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:11,588 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [148] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [239] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem17=|v_ULTIMATE.start_main_#t~mem17_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post18=|v_ULTIMATE.start_main_#t~post18_1|, ULTIMATE.start_main_#t~post16=|v_ULTIMATE.start_main_#t~post16_1|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~short9=|v_ULTIMATE.start_main_#t~short9_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem20, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem17, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~post12, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post18, ULTIMATE.start_main_#t~post16, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~short9, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 42#L9true [166] L9-->L9-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 41#L9-1true [247] L9-1-->L9-2: Formula: (and (< 10000 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short5_2|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 39#L9-2true [163] L9-2-->L9-6: Formula: |v_ULTIMATE.start_main_#t~short5_3| InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_3|} AuxVars[] AssignedVars[] 52#L9-6true [249] L9-6-->L9-7: Formula: (and |v_ULTIMATE.start_main_#t~short5_6| |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 50#L9-7true [176] L9-7-->L9-11: Formula: |v_ULTIMATE.start_main_#t~short7_3| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_3|} AuxVars[] AssignedVars[] 26#L9-11true [257] L9-11-->L9-12: Formula: (and (not |v_ULTIMATE.start_main_#t~short7_6|) (not |v_ULTIMATE.start_main_#t~short9_2|)) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~short9=|v_ULTIMATE.start_main_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short9] 24#L9-12true [140] L9-12-->L9-16: Formula: |v_ULTIMATE.start_main_#t~short9_3| InVars {ULTIMATE.start_main_#t~short9=|v_ULTIMATE.start_main_#t~short9_3|} OutVars{ULTIMATE.start_main_#t~short9=|v_ULTIMATE.start_main_#t~short9_3|} AuxVars[] AssignedVars[] 32#L9-16true [155] L9-16-->L12-3: Formula: (not |v_ULTIMATE.start_main_#t~short9_9|) InVars {ULTIMATE.start_main_#t~short9=|v_ULTIMATE.start_main_#t~short9_9|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~short9=|v_ULTIMATE.start_main_#t~short9_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~short9, ULTIMATE.start_main_#t~mem3] 27#L12-3true [2020-07-01 13:10:11,589 INFO L796 eck$LassoCheckResult]: Loop: 27#L12-3true [327] L12-3-->L13: Formula: (and (<= 1 (select (select |v_#memory_int_32| v_ULTIMATE.start_main_~y~0.base_20) v_ULTIMATE.start_main_~y~0.offset_15)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_15) (= 1 (select |v_#valid_56| v_ULTIMATE.start_main_~y~0.base_20)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_15 4) (select |v_#length_44| v_ULTIMATE.start_main_~y~0.base_20))) InVars {#valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_9|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_20, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_15, #length=|v_#length_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 62#L13true [320] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem11_5| |v_ULTIMATE.start_main_#t~post12_5|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18) (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~x~0.base_25)) (= |v_ULTIMATE.start_main_#t~mem11_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18))) InVars {#valid=|v_#valid_49|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #memory_int=|v_#memory_int_21|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_5|, #valid=|v_#valid_49|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #memory_int=|v_#memory_int_21|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~post12] 61#L13-2true [321] L13-2-->L14-4: Formula: (and (= 1 (select |v_#valid_50| v_ULTIMATE.start_main_~x~0.base_26)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~post12_7| (- 1)))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_38| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19)) InVars {ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_7|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_38|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~post12=|v_ULTIMATE.start_main_#t~post12_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_38|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~post12, #memory_int] 11#L14-4true [124] L14-4-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem13_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_19|, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 17#L14-1true [129] L14-1-->L14-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_21| v_ULTIMATE.start_main_~z~0.base_7)) (= (select |v_#valid_27| v_ULTIMATE.start_main_~z~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6)) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 14#L14-2true [223] L14-2-->L14-5: Formula: (>= |v_ULTIMATE.start_main_#t~mem13_4| |v_ULTIMATE.start_main_#t~mem14_4|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 59#L14-5true [184] L14-5-->L18: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_16) (= (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_22) v_ULTIMATE.start_main_~x~0.offset_16) |v_ULTIMATE.start_main_#t~mem19_2|) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_22)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_16 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_22))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_17|, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22, #valid=|v_#valid_37|} OutVars{#valid=|v_#valid_37|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_16, #memory_int=|v_#memory_int_17|, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19] 7#L18true [119] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_10) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_33| v_ULTIMATE.start_main_~y~0.base_13)) (= |v_ULTIMATE.start_main_#t~mem20_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y~0.base_13))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_33|, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20] 6#L18-1true [324] L18-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_14) (= 1 (select |v_#valid_53| v_ULTIMATE.start_main_~y~0.base_19)) (= (store |v_#memory_int_28| v_ULTIMATE.start_main_~y~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_main_~y~0.base_19) v_ULTIMATE.start_main_~y~0.offset_14 (+ |v_ULTIMATE.start_main_#t~mem19_6| |v_ULTIMATE.start_main_#t~mem20_6|))) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_14 4) (select |v_#length_41| v_ULTIMATE.start_main_~y~0.base_19))) InVars {ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_6|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_41|} OutVars{ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_5|, #valid=|v_#valid_53|, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_5|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_19, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_14, #length=|v_#length_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20, ULTIMATE.start_main_#t~mem19, #memory_int] 27#L12-3true [2020-07-01 13:10:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash -980246461, now seen corresponding path program 1 times [2020-07-01 13:10:11,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:11,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048824141] [2020-07-01 13:10:11,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:11,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048824141] [2020-07-01 13:10:11,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:11,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:11,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983086831] [2020-07-01 13:10:11,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:10:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1626768594, now seen corresponding path program 1 times [2020-07-01 13:10:11,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:11,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038264366] [2020-07-01 13:10:11,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:10:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:10:11,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:10:11,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:11,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,789 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2020-07-01 13:10:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:11,904 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2020-07-01 13:10:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:11,907 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:10:11,912 INFO L168 Benchmark]: Toolchain (without parser) took 3449.21 ms. Allocated memory was 649.6 MB in the beginning and 751.3 MB in the end (delta: 101.7 MB). Free memory was 555.9 MB in the beginning and 578.0 MB in the end (delta: -22.2 MB). Peak memory consumption was 79.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,912 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:10:11,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.08 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 555.9 MB in the beginning and 645.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.33 ms. Allocated memory is still 683.7 MB. Free memory was 645.4 MB in the beginning and 644.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,914 INFO L168 Benchmark]: Boogie Preprocessor took 25.23 ms. Allocated memory is still 683.7 MB. Free memory was 644.3 MB in the beginning and 642.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,914 INFO L168 Benchmark]: RCFGBuilder took 404.81 ms. Allocated memory is still 683.7 MB. Free memory was 642.1 MB in the beginning and 610.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,915 INFO L168 Benchmark]: BlockEncodingV2 took 147.67 ms. Allocated memory is still 683.7 MB. Free memory was 610.2 MB in the beginning and 596.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,915 INFO L168 Benchmark]: TraceAbstraction took 2151.29 ms. Allocated memory was 683.7 MB in the beginning and 751.3 MB in the end (delta: 67.6 MB). Free memory was 595.1 MB in the beginning and 625.1 MB in the end (delta: -30.0 MB). Peak memory consumption was 37.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,916 INFO L168 Benchmark]: BuchiAutomizer took 375.76 ms. Allocated memory is still 751.3 MB. Free memory was 625.1 MB in the beginning and 578.0 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,919 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 73 locations, 80 edges - StatisticsResult: Encoded RCFG 61 locations, 110 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 298.08 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 555.9 MB in the beginning and 645.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.33 ms. Allocated memory is still 683.7 MB. Free memory was 645.4 MB in the beginning and 644.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.23 ms. Allocated memory is still 683.7 MB. Free memory was 644.3 MB in the beginning and 642.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 404.81 ms. Allocated memory is still 683.7 MB. Free memory was 642.1 MB in the beginning and 610.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 147.67 ms. Allocated memory is still 683.7 MB. Free memory was 610.2 MB in the beginning and 596.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2151.29 ms. Allocated memory was 683.7 MB in the beginning and 751.3 MB in the end (delta: 67.6 MB). Free memory was 595.1 MB in the beginning and 625.1 MB in the end (delta: -30.0 MB). Peak memory consumption was 37.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 375.76 ms. Allocated memory is still 751.3 MB. Free memory was 625.1 MB in the beginning and 578.0 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 13:10:11,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:11,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[y] && 4 == unknown-#length-unknown[z]) && \valid[x] == 1) && 0 == z) && 1 == \valid[z]) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:10:11,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:11,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[y] && 4 == unknown-#length-unknown[z]) && \valid[x] == 1) && 0 == z) && 1 == \valid[z]) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 32 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 187 SDtfs, 541 SDslu, 245 SDs, 0 SdLazy, 811 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 86 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 3519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:10:05.133 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_m64GJY/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:10:12.160 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check