java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test27_false-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:20,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:20,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:20,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:20,477 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:20,478 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:20,480 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:20,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:20,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:20,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:20,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:20,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:20,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:20,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:20,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:20,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:20,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:20,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:20,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:20,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:20,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:20,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:20,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:20,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:20,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:20,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:20,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:20,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:20,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:20,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:20,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:20,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:20,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:20,523 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:20,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:20,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:20,529 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:20,557 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:20,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:20,558 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:20,558 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:20,558 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:20,559 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:20,559 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:20,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:20,559 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:20,559 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:20,560 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:20,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:20,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:20,560 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:20,560 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:20,561 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:20,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:20,561 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:20,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:20,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:20,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:20,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:20,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:20,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:20,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:20,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:20,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:20,563 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:20,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:20,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:20,563 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:20,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:20,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:20,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:20,647 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:20,647 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:20,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-23 12:54:20,728 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0593cab47/92c83130eb5d4d9eae57b02c027e2425/FLAGed097634d [2018-11-23 12:54:21,192 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:21,193 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-23 12:54:21,199 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0593cab47/92c83130eb5d4d9eae57b02c027e2425/FLAGed097634d [2018-11-23 12:54:21,543 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0593cab47/92c83130eb5d4d9eae57b02c027e2425 [2018-11-23 12:54:21,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:21,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:21,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:21,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:21,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:21,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:21,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b45830f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21, skipping insertion in model container [2018-11-23 12:54:21,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:21,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:21,607 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:21,893 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:21,905 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:21,933 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:21,953 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:21,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21 WrapperNode [2018-11-23 12:54:21,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:21,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:21,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:21,955 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:21,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:21,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:21,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:21,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:21,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:21,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:21,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:21,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:21,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:21,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:22,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:22,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:22,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... [2018-11-23 12:54:22,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:22,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:22,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:22,033 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:22,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:22,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:54:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:22,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 12:54:22,165 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 12:54:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:54:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:22,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:22,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:23,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:23,172 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:54:23,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:23 BoogieIcfgContainer [2018-11-23 12:54:23,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:23,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:23,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:23,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:23,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:21" (1/3) ... [2018-11-23 12:54:23,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce4006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:23, skipping insertion in model container [2018-11-23 12:54:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:21" (2/3) ... [2018-11-23 12:54:23,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce4006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:23, skipping insertion in model container [2018-11-23 12:54:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:23" (3/3) ... [2018-11-23 12:54:23,181 INFO L112 eAbstractionObserver]: Analyzing ICFG test27_false-unreach-call_true-termination.c [2018-11-23 12:54:23,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:23,201 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:23,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:23,253 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:23,254 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:23,254 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:23,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:23,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:23,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:23,256 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:23,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:23,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:54:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:54:23,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:23,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:23,285 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:23,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-23 12:54:23,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:23,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:23,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:54:23,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:54:23,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:23,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #58#return; {28#true} is VALID [2018-11-23 12:54:23,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret18 := main(); {28#true} is VALID [2018-11-23 12:54:23,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {28#true} is VALID [2018-11-23 12:54:23,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:54:23,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29#false} is VALID [2018-11-23 12:54:23,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {29#false} is VALID [2018-11-23 12:54:23,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2018-11-23 12:54:23,467 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {28#true} is VALID [2018-11-23 12:54:23,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {28#true} is VALID [2018-11-23 12:54:23,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:23,468 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #62#return; {29#false} is VALID [2018-11-23 12:54:23,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {29#false} is VALID [2018-11-23 12:54:23,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret17;havoc #t~ret17; {29#false} is VALID [2018-11-23 12:54:23,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:54:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:23,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:23,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:54:23,480 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:23,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:23,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:54:23,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:23,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:54:23,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:54:23,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:23,577 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:54:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,892 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 12:54:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:54:23,892 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:54:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:54:23,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 12:54:24,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:24,219 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:54:24,219 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:54:24,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:54:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:54:24,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:24,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:24,286 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:24,286 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,289 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:24,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,290 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:24,290 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,294 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:24,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:24,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:54:24,300 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:54:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:24,300 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:54:24,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:54:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:54:24,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:24,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:24,302 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:24,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-23 12:54:24,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:24,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:24,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2018-11-23 12:54:24,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {156#true} is VALID [2018-11-23 12:54:24,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:24,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #58#return; {156#true} is VALID [2018-11-23 12:54:24,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret18 := main(); {156#true} is VALID [2018-11-23 12:54:24,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {158#(= main_~j~0 0)} is VALID [2018-11-23 12:54:24,437 INFO L273 TraceCheckUtils]: 6: Hoare triple {158#(= main_~j~0 0)} assume !(~j~0 < 10); {157#false} is VALID [2018-11-23 12:54:24,438 INFO L273 TraceCheckUtils]: 7: Hoare triple {157#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {157#false} is VALID [2018-11-23 12:54:24,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {157#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {157#false} is VALID [2018-11-23 12:54:24,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {157#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {157#false} is VALID [2018-11-23 12:54:24,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {157#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {157#false} is VALID [2018-11-23 12:54:24,439 INFO L256 TraceCheckUtils]: 11: Hoare triple {157#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {156#true} is VALID [2018-11-23 12:54:24,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {156#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {156#true} is VALID [2018-11-23 12:54:24,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:24,440 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {156#true} {157#false} #62#return; {157#false} is VALID [2018-11-23 12:54:24,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {157#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {157#false} is VALID [2018-11-23 12:54:24,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {157#false} assume 0 == #t~ret17;havoc #t~ret17; {157#false} is VALID [2018-11-23 12:54:24,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {157#false} assume !false; {157#false} is VALID [2018-11-23 12:54:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:24,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:24,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:54:24,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:24,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:24,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:54:24,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:24,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:54:24,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:54:24,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:54:24,635 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 12:54:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,076 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:54:25,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:54:25,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:25,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 12:54:25,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:25,262 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:54:25,263 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:54:25,264 INFO L631 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 [2018-11-23 12:54:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:54:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 12:54:25,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:25,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:25,284 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:25,285 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,287 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:25,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:25,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:25,288 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:25,288 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,291 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:25,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:25,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:25,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:25,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:54:25,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 12:54:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:25,295 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:54:25,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:54:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:54:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:54:25,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:25,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:25,297 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:25,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-23 12:54:25,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:25,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:25,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:25,436 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 12:54:25,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:25,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #58#return; {284#true} is VALID [2018-11-23 12:54:25,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret18 := main(); {284#true} is VALID [2018-11-23 12:54:25,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:25,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:25,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:25,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 10); {285#false} is VALID [2018-11-23 12:54:25,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {285#false} is VALID [2018-11-23 12:54:25,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {285#false} is VALID [2018-11-23 12:54:25,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:25,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {285#false} is VALID [2018-11-23 12:54:25,445 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {284#true} is VALID [2018-11-23 12:54:25,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {284#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {284#true} is VALID [2018-11-23 12:54:25,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:25,446 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {284#true} {285#false} #62#return; {285#false} is VALID [2018-11-23 12:54:25,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:25,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret17;havoc #t~ret17; {285#false} is VALID [2018-11-23 12:54:25,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:25,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:25,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:25,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:25,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:25,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 12:54:25,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:25,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #58#return; {284#true} is VALID [2018-11-23 12:54:25,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret18 := main(); {284#true} is VALID [2018-11-23 12:54:25,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:25,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:25,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:25,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 10); {285#false} is VALID [2018-11-23 12:54:25,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {285#false} is VALID [2018-11-23 12:54:25,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {285#false} is VALID [2018-11-23 12:54:25,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:25,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {285#false} is VALID [2018-11-23 12:54:25,822 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {285#false} is VALID [2018-11-23 12:54:25,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {285#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {285#false} is VALID [2018-11-23 12:54:25,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#false} assume true; {285#false} is VALID [2018-11-23 12:54:25,823 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {285#false} {285#false} #62#return; {285#false} is VALID [2018-11-23 12:54:25,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:25,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret17;havoc #t~ret17; {285#false} is VALID [2018-11-23 12:54:25,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:25,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:25,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:54:25,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:25,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:25,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:25,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:25,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:25,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:25,966 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 12:54:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,179 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:54:26,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:26,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:26,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-23 12:54:26,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:26,363 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:54:26,364 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:54:26,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:54:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 12:54:26,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:26,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:26,433 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:26,433 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,435 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:26,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,436 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:26,436 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,438 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:26,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:26,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:54:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:54:26,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-23 12:54:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:26,442 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:54:26,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:54:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:54:26,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:26,444 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:26,444 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:26,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-23 12:54:26,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:26,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:26,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-23 12:54:26,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:26,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #58#return; {481#true} is VALID [2018-11-23 12:54:26,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret18 := main(); {481#true} is VALID [2018-11-23 12:54:26,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:26,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:26,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {485#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {485#(<= main_~j~0 2)} assume !(~j~0 < 10); {482#false} is VALID [2018-11-23 12:54:26,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {482#false} is VALID [2018-11-23 12:54:26,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {482#false} is VALID [2018-11-23 12:54:26,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {482#false} is VALID [2018-11-23 12:54:26,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {482#false} is VALID [2018-11-23 12:54:26,629 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {481#true} is VALID [2018-11-23 12:54:26,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {481#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {481#true} is VALID [2018-11-23 12:54:26,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:26,630 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {481#true} {482#false} #62#return; {482#false} is VALID [2018-11-23 12:54:26,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:26,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret17;havoc #t~ret17; {482#false} is VALID [2018-11-23 12:54:26,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:26,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:26,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:26,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:26,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:26,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:26,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:26,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-23 12:54:26,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:26,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #58#return; {481#true} is VALID [2018-11-23 12:54:26,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret18 := main(); {481#true} is VALID [2018-11-23 12:54:26,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {504#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:26,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {504#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:26,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {504#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {485#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {485#(<= main_~j~0 2)} assume !(~j~0 < 10); {482#false} is VALID [2018-11-23 12:54:26,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {482#false} is VALID [2018-11-23 12:54:26,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {482#false} is VALID [2018-11-23 12:54:26,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {482#false} is VALID [2018-11-23 12:54:26,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {482#false} is VALID [2018-11-23 12:54:26,858 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {482#false} is VALID [2018-11-23 12:54:26,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {482#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {482#false} is VALID [2018-11-23 12:54:26,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-23 12:54:26,859 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {482#false} {482#false} #62#return; {482#false} is VALID [2018-11-23 12:54:26,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:26,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret17;havoc #t~ret17; {482#false} is VALID [2018-11-23 12:54:26,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:26,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:26,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:54:26,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:54:26,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:26,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:54:27,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:27,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:54:27,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:54:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:27,001 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-23 12:54:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:27,177 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 12:54:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:54:27,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:54:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 12:54:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 12:54:27,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2018-11-23 12:54:27,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:27,264 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:54:27,264 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:54:27,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:54:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 12:54:27,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:27,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 12:54:27,281 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 12:54:27,281 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 12:54:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:27,284 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:54:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:54:27,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:27,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:27,285 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 12:54:27,285 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 12:54:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:27,287 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:54:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:54:27,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:27,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:27,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:27,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:54:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 12:54:27,290 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-23 12:54:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:27,291 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 12:54:27,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:54:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:54:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:54:27,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:27,292 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:27,293 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:27,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2113766385, now seen corresponding path program 3 times [2018-11-23 12:54:27,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:27,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:27,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:27,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:27,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:27,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:54:27,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 12:54:27,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:54:27,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #58#return; {695#true} is VALID [2018-11-23 12:54:27,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret18 := main(); {695#true} is VALID [2018-11-23 12:54:27,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {697#(= main_~j~0 0)} is VALID [2018-11-23 12:54:27,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {697#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {697#(= main_~j~0 0)} is VALID [2018-11-23 12:54:27,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {697#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:27,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {698#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:27,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {698#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:27,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {699#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:27,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {699#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {700#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:27,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {700#(<= main_~j~0 3)} assume !(~j~0 < 10); {696#false} is VALID [2018-11-23 12:54:27,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {696#false} is VALID [2018-11-23 12:54:27,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {696#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {696#false} is VALID [2018-11-23 12:54:27,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {696#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {696#false} is VALID [2018-11-23 12:54:27,476 INFO L273 TraceCheckUtils]: 16: Hoare triple {696#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {696#false} is VALID [2018-11-23 12:54:27,477 INFO L256 TraceCheckUtils]: 17: Hoare triple {696#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {695#true} is VALID [2018-11-23 12:54:27,477 INFO L273 TraceCheckUtils]: 18: Hoare triple {695#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {695#true} is VALID [2018-11-23 12:54:27,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:54:27,478 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {695#true} {696#false} #62#return; {696#false} is VALID [2018-11-23 12:54:27,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {696#false} is VALID [2018-11-23 12:54:27,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {696#false} assume 0 == #t~ret17;havoc #t~ret17; {696#false} is VALID [2018-11-23 12:54:27,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:54:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:27,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:27,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:27,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:27,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:54:27,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:27,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:27,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:54:27,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 12:54:27,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:54:27,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #58#return; {695#true} is VALID [2018-11-23 12:54:27,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret18 := main(); {695#true} is VALID [2018-11-23 12:54:27,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {719#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:27,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {719#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {719#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:27,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {719#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:27,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {698#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:27,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {698#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:27,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {699#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:27,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {699#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {700#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:27,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {700#(<= main_~j~0 3)} assume !(~j~0 < 10); {696#false} is VALID [2018-11-23 12:54:27,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {696#false} is VALID [2018-11-23 12:54:27,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {696#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {696#false} is VALID [2018-11-23 12:54:27,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {696#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {696#false} is VALID [2018-11-23 12:54:27,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {696#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {696#false} is VALID [2018-11-23 12:54:27,810 INFO L256 TraceCheckUtils]: 17: Hoare triple {696#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {696#false} is VALID [2018-11-23 12:54:27,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {696#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {696#false} is VALID [2018-11-23 12:54:27,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {696#false} assume true; {696#false} is VALID [2018-11-23 12:54:27,811 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {696#false} {696#false} #62#return; {696#false} is VALID [2018-11-23 12:54:27,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {696#false} is VALID [2018-11-23 12:54:27,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {696#false} assume 0 == #t~ret17;havoc #t~ret17; {696#false} is VALID [2018-11-23 12:54:27,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:54:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:54:27,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 12:54:27,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:27,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:27,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:27,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:27,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:27,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:27,879 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-11-23 12:54:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,090 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:54:28,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:54:28,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 12:54:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:28,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 12:54:28,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:28,157 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:54:28,157 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:54:28,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:54:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:54:28,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:28,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:28,259 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:28,260 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,261 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:28,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:28,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:28,263 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:28,263 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,265 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:28,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:28,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:28,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:28,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:54:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:54:28,268 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-23 12:54:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:28,268 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:54:28,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:54:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:54:28,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:28,270 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:28,270 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:28,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1818492333, now seen corresponding path program 4 times [2018-11-23 12:54:28,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:28,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:28,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:28,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:28,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:28,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-23 12:54:28,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-23 12:54:28,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-23 12:54:28,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #58#return; {926#true} is VALID [2018-11-23 12:54:28,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret18 := main(); {926#true} is VALID [2018-11-23 12:54:28,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {928#(= main_~j~0 0)} is VALID [2018-11-23 12:54:28,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {928#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {928#(= main_~j~0 0)} is VALID [2018-11-23 12:54:28,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {928#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {929#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {929#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {930#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {930#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {932#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:28,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {932#(<= main_~j~0 4)} assume !(~j~0 < 10); {927#false} is VALID [2018-11-23 12:54:28,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {927#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {927#false} is VALID [2018-11-23 12:54:28,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {927#false} is VALID [2018-11-23 12:54:28,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {927#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {927#false} is VALID [2018-11-23 12:54:28,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {927#false} is VALID [2018-11-23 12:54:28,620 INFO L256 TraceCheckUtils]: 19: Hoare triple {927#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {926#true} is VALID [2018-11-23 12:54:28,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {926#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {926#true} is VALID [2018-11-23 12:54:28,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-23 12:54:28,621 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {926#true} {927#false} #62#return; {927#false} is VALID [2018-11-23 12:54:28,621 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {927#false} is VALID [2018-11-23 12:54:28,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume 0 == #t~ret17;havoc #t~ret17; {927#false} is VALID [2018-11-23 12:54:28,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-23 12:54:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:28,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:28,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:28,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:54:28,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:54:28,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:28,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:29,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-23 12:54:29,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-23 12:54:29,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-23 12:54:29,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #58#return; {926#true} is VALID [2018-11-23 12:54:29,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret18 := main(); {926#true} is VALID [2018-11-23 12:54:29,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {951#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:29,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {951#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {951#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:29,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {951#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:29,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {929#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:29,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {929#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:29,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {930#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:29,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {930#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:29,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:29,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {932#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:29,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {932#(<= main_~j~0 4)} assume !(~j~0 < 10); {927#false} is VALID [2018-11-23 12:54:29,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {927#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {927#false} is VALID [2018-11-23 12:54:29,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {927#false} is VALID [2018-11-23 12:54:29,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {927#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {927#false} is VALID [2018-11-23 12:54:29,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {927#false} is VALID [2018-11-23 12:54:29,325 INFO L256 TraceCheckUtils]: 19: Hoare triple {927#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {927#false} is VALID [2018-11-23 12:54:29,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {927#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {927#false} is VALID [2018-11-23 12:54:29,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-23 12:54:29,326 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {927#false} {927#false} #62#return; {927#false} is VALID [2018-11-23 12:54:29,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {927#false} is VALID [2018-11-23 12:54:29,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume 0 == #t~ret17;havoc #t~ret17; {927#false} is VALID [2018-11-23 12:54:29,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-23 12:54:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:29,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:29,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:54:29,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 12:54:29,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:29,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:54:29,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:29,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:54:29,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:54:29,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:29,431 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-11-23 12:54:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:29,708 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:54:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:54:29,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 12:54:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:29,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2018-11-23 12:54:29,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:29,847 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:54:29,847 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:54:29,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:54:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:54:29,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:29,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:29,870 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:29,870 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:29,872 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:29,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:29,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:29,873 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:29,873 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:29,875 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:29,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:29,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:29,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:29,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:54:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 12:54:29,878 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-23 12:54:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:29,878 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 12:54:29,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:54:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:54:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:54:29,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:29,880 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:29,880 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:29,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1147899851, now seen corresponding path program 5 times [2018-11-23 12:54:29,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:29,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:29,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:29,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:30,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2018-11-23 12:54:30,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1174#true} is VALID [2018-11-23 12:54:30,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2018-11-23 12:54:30,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #58#return; {1174#true} is VALID [2018-11-23 12:54:30,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret18 := main(); {1174#true} is VALID [2018-11-23 12:54:30,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {1174#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1176#(= main_~j~0 0)} is VALID [2018-11-23 12:54:30,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {1176#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1176#(= main_~j~0 0)} is VALID [2018-11-23 12:54:30,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {1176#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:30,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:30,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {1177#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:30,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:30,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:30,053 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:30,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:30,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {1180#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:30,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1181#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:30,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {1181#(<= main_~j~0 5)} assume !(~j~0 < 10); {1175#false} is VALID [2018-11-23 12:54:30,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {1175#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1175#false} is VALID [2018-11-23 12:54:30,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {1175#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {1175#false} is VALID [2018-11-23 12:54:30,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {1175#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {1175#false} is VALID [2018-11-23 12:54:30,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {1175#false} is VALID [2018-11-23 12:54:30,056 INFO L256 TraceCheckUtils]: 21: Hoare triple {1175#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1174#true} is VALID [2018-11-23 12:54:30,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {1174#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {1174#true} is VALID [2018-11-23 12:54:30,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {1174#true} assume true; {1174#true} is VALID [2018-11-23 12:54:30,057 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1174#true} {1175#false} #62#return; {1175#false} is VALID [2018-11-23 12:54:30,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {1175#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {1175#false} is VALID [2018-11-23 12:54:30,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {1175#false} assume 0 == #t~ret17;havoc #t~ret17; {1175#false} is VALID [2018-11-23 12:54:30,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2018-11-23 12:54:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:30,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:30,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:30,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:54:31,419 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:54:31,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:31,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:31,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2018-11-23 12:54:31,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1174#true} is VALID [2018-11-23 12:54:31,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2018-11-23 12:54:31,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #58#return; {1174#true} is VALID [2018-11-23 12:54:31,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret18 := main(); {1174#true} is VALID [2018-11-23 12:54:31,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {1174#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1200#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:31,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1200#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:31,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:31,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:31,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {1177#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:31,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:31,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:31,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:31,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:31,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {1180#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:31,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1181#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:31,633 INFO L273 TraceCheckUtils]: 16: Hoare triple {1181#(<= main_~j~0 5)} assume !(~j~0 < 10); {1175#false} is VALID [2018-11-23 12:54:31,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {1175#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1175#false} is VALID [2018-11-23 12:54:31,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {1175#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {1175#false} is VALID [2018-11-23 12:54:31,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {1175#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {1175#false} is VALID [2018-11-23 12:54:31,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {1175#false} is VALID [2018-11-23 12:54:31,634 INFO L256 TraceCheckUtils]: 21: Hoare triple {1175#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1175#false} is VALID [2018-11-23 12:54:31,634 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {1175#false} is VALID [2018-11-23 12:54:31,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {1175#false} assume true; {1175#false} is VALID [2018-11-23 12:54:31,634 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1175#false} {1175#false} #62#return; {1175#false} is VALID [2018-11-23 12:54:31,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {1175#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {1175#false} is VALID [2018-11-23 12:54:31,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {1175#false} assume 0 == #t~ret17;havoc #t~ret17; {1175#false} is VALID [2018-11-23 12:54:31,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2018-11-23 12:54:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:31,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:31,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:54:31,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:54:31,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:31,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:54:31,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:31,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:54:31,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:54:31,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:31,718 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-11-23 12:54:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,074 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:54:32,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:54:32,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:54:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:54:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:54:32,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2018-11-23 12:54:32,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:32,190 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:54:32,190 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:54:32,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:54:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:54:32,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:32,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:32,207 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:32,207 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,210 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:32,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:32,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:32,211 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:32,211 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,213 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:32,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:32,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:32,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:32,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:54:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 12:54:32,216 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-23 12:54:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:32,216 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 12:54:32,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:54:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:54:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:54:32,217 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:32,217 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:32,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:32,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:32,218 INFO L82 PathProgramCache]: Analyzing trace with hash -953619049, now seen corresponding path program 6 times [2018-11-23 12:54:32,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:32,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:32,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2018-11-23 12:54:32,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {1439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1439#true} is VALID [2018-11-23 12:54:32,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2018-11-23 12:54:32,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #58#return; {1439#true} is VALID [2018-11-23 12:54:32,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret18 := main(); {1439#true} is VALID [2018-11-23 12:54:32,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {1439#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1441#(= main_~j~0 0)} is VALID [2018-11-23 12:54:32,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {1441#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1441#(= main_~j~0 0)} is VALID [2018-11-23 12:54:32,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {1441#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {1442#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {1442#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {1443#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {1445#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1447#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:32,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {1447#(<= main_~j~0 6)} assume !(~j~0 < 10); {1440#false} is VALID [2018-11-23 12:54:32,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {1440#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1440#false} is VALID [2018-11-23 12:54:32,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {1440#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {1440#false} is VALID [2018-11-23 12:54:32,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {1440#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {1440#false} is VALID [2018-11-23 12:54:32,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {1440#false} is VALID [2018-11-23 12:54:32,569 INFO L256 TraceCheckUtils]: 23: Hoare triple {1440#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1439#true} is VALID [2018-11-23 12:54:32,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {1439#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {1439#true} is VALID [2018-11-23 12:54:32,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {1439#true} assume true; {1439#true} is VALID [2018-11-23 12:54:32,569 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1439#true} {1440#false} #62#return; {1440#false} is VALID [2018-11-23 12:54:32,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {1440#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {1440#false} is VALID [2018-11-23 12:54:32,570 INFO L273 TraceCheckUtils]: 28: Hoare triple {1440#false} assume 0 == #t~ret17;havoc #t~ret17; {1440#false} is VALID [2018-11-23 12:54:32,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2018-11-23 12:54:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:32,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:32,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:32,584 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:54:36,241 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:54:36,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:36,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:36,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2018-11-23 12:54:36,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {1439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1439#true} is VALID [2018-11-23 12:54:36,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2018-11-23 12:54:36,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #58#return; {1439#true} is VALID [2018-11-23 12:54:36,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret18 := main(); {1439#true} is VALID [2018-11-23 12:54:36,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {1439#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1466#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:36,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {1466#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1466#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:36,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {1466#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:36,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {1442#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:36,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {1442#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:36,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:36,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {1443#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:36,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:36,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:36,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {1445#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:36,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:36,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:36,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1447#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:36,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {1447#(<= main_~j~0 6)} assume !(~j~0 < 10); {1440#false} is VALID [2018-11-23 12:54:36,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {1440#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1440#false} is VALID [2018-11-23 12:54:36,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {1440#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {1440#false} is VALID [2018-11-23 12:54:36,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {1440#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {1440#false} is VALID [2018-11-23 12:54:36,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {1440#false} is VALID [2018-11-23 12:54:36,362 INFO L256 TraceCheckUtils]: 23: Hoare triple {1440#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1440#false} is VALID [2018-11-23 12:54:36,363 INFO L273 TraceCheckUtils]: 24: Hoare triple {1440#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {1440#false} is VALID [2018-11-23 12:54:36,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {1440#false} assume true; {1440#false} is VALID [2018-11-23 12:54:36,364 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1440#false} {1440#false} #62#return; {1440#false} is VALID [2018-11-23 12:54:36,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {1440#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {1440#false} is VALID [2018-11-23 12:54:36,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {1440#false} assume 0 == #t~ret17;havoc #t~ret17; {1440#false} is VALID [2018-11-23 12:54:36,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2018-11-23 12:54:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:36,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:36,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:54:36,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 12:54:36,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:36,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:54:36,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:36,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:54:36,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:54:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:54:36,485 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-11-23 12:54:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,807 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:54:36,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:54:36,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 12:54:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-23 12:54:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-23 12:54:36,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2018-11-23 12:54:37,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:37,034 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:54:37,034 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:54:37,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:54:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:54:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:54:37,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:37,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:54:37,062 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:54:37,063 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:54:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,065 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:54:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:54:37,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:37,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:37,066 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:54:37,067 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:54:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,068 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:54:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:54:37,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:37,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:37,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:37,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:54:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 12:54:37,070 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-23 12:54:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:37,071 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 12:54:37,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:54:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:54:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:54:37,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:37,072 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:37,072 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:37,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1066637945, now seen corresponding path program 7 times [2018-11-23 12:54:37,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:37,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:37,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1721#true} is VALID [2018-11-23 12:54:37,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {1721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1721#true} is VALID [2018-11-23 12:54:37,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 12:54:37,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1721#true} {1721#true} #58#return; {1721#true} is VALID [2018-11-23 12:54:37,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {1721#true} call #t~ret18 := main(); {1721#true} is VALID [2018-11-23 12:54:37,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {1721#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1723#(= main_~j~0 0)} is VALID [2018-11-23 12:54:37,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {1723#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1723#(= main_~j~0 0)} is VALID [2018-11-23 12:54:37,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {1723#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {1724#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {1724#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {1726#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {1726#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {1727#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {1727#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {1728#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {1728#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {1729#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {1729#(<= main_~j~0 6)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1730#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:37,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {1730#(<= main_~j~0 7)} assume !(~j~0 < 10); {1722#false} is VALID [2018-11-23 12:54:37,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {1722#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1722#false} is VALID [2018-11-23 12:54:37,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {1722#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {1722#false} is VALID [2018-11-23 12:54:37,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {1722#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {1722#false} is VALID [2018-11-23 12:54:37,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {1722#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {1722#false} is VALID [2018-11-23 12:54:37,547 INFO L256 TraceCheckUtils]: 25: Hoare triple {1722#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1721#true} is VALID [2018-11-23 12:54:37,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {1721#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {1721#true} is VALID [2018-11-23 12:54:37,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 12:54:37,548 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1721#true} {1722#false} #62#return; {1722#false} is VALID [2018-11-23 12:54:37,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {1722#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {1722#false} is VALID [2018-11-23 12:54:37,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {1722#false} assume 0 == #t~ret17;havoc #t~ret17; {1722#false} is VALID [2018-11-23 12:54:37,549 INFO L273 TraceCheckUtils]: 31: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2018-11-23 12:54:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:37,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:37,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:37,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:37,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:37,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1721#true} is VALID [2018-11-23 12:54:37,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {1721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1721#true} is VALID [2018-11-23 12:54:37,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 12:54:37,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1721#true} {1721#true} #58#return; {1721#true} is VALID [2018-11-23 12:54:37,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {1721#true} call #t~ret18 := main(); {1721#true} is VALID [2018-11-23 12:54:37,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {1721#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1749#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:37,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {1749#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1749#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:37,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {1749#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {1724#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {1724#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {1726#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {1726#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {1727#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {1727#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {1728#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {1728#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {1729#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {1729#(<= main_~j~0 6)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1730#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:37,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {1730#(<= main_~j~0 7)} assume !(~j~0 < 10); {1722#false} is VALID [2018-11-23 12:54:37,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {1722#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1722#false} is VALID [2018-11-23 12:54:37,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {1722#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {1722#false} is VALID [2018-11-23 12:54:37,826 INFO L273 TraceCheckUtils]: 23: Hoare triple {1722#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {1722#false} is VALID [2018-11-23 12:54:37,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {1722#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {1722#false} is VALID [2018-11-23 12:54:37,826 INFO L256 TraceCheckUtils]: 25: Hoare triple {1722#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1722#false} is VALID [2018-11-23 12:54:37,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {1722#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {1722#false} is VALID [2018-11-23 12:54:37,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {1722#false} assume true; {1722#false} is VALID [2018-11-23 12:54:37,826 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1722#false} {1722#false} #62#return; {1722#false} is VALID [2018-11-23 12:54:37,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {1722#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {1722#false} is VALID [2018-11-23 12:54:37,827 INFO L273 TraceCheckUtils]: 30: Hoare triple {1722#false} assume 0 == #t~ret17;havoc #t~ret17; {1722#false} is VALID [2018-11-23 12:54:37,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2018-11-23 12:54:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:37,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:37,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:54:37,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 12:54:37,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:37,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:54:37,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:37,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:54:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:54:37,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:37,895 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 12:54:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,355 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:54:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:54:38,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 12:54:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:38,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-23 12:54:38,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:38,442 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:54:38,443 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:54:38,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:54:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 12:54:38,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:38,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:38,456 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:38,457 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,458 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:38,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,459 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:38,459 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,460 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:38,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:38,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:54:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 12:54:38,463 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-23 12:54:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:38,463 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 12:54:38,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:54:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:54:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:54:38,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:38,464 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:38,464 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:38,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1208391387, now seen corresponding path program 8 times [2018-11-23 12:54:38,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:38,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:38,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:38,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2018-11-23 12:54:38,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2020#true} is VALID [2018-11-23 12:54:38,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:54:38,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #58#return; {2020#true} is VALID [2018-11-23 12:54:38,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret18 := main(); {2020#true} is VALID [2018-11-23 12:54:38,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {2020#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {2022#(= main_~j~0 0)} is VALID [2018-11-23 12:54:38,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {2022#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2022#(= main_~j~0 0)} is VALID [2018-11-23 12:54:38,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {2022#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:38,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {2023#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:38,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:38,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {2024#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:38,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {2024#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:38,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {2025#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:38,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {2025#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:38,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {2026#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:38,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {2026#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:38,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {2027#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:38,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {2027#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:38,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:38,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(<= main_~j~0 6)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:38,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {2029#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:38,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#(<= main_~j~0 7)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2030#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:38,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {2030#(<= main_~j~0 8)} assume !(~j~0 < 10); {2021#false} is VALID [2018-11-23 12:54:38,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2021#false} is VALID [2018-11-23 12:54:38,790 INFO L273 TraceCheckUtils]: 24: Hoare triple {2021#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {2021#false} is VALID [2018-11-23 12:54:38,791 INFO L273 TraceCheckUtils]: 25: Hoare triple {2021#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {2021#false} is VALID [2018-11-23 12:54:38,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {2021#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {2021#false} is VALID [2018-11-23 12:54:38,791 INFO L256 TraceCheckUtils]: 27: Hoare triple {2021#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2020#true} is VALID [2018-11-23 12:54:38,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {2020#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {2020#true} is VALID [2018-11-23 12:54:38,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:54:38,792 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2020#true} {2021#false} #62#return; {2021#false} is VALID [2018-11-23 12:54:38,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {2021#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2021#false} is VALID [2018-11-23 12:54:38,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {2021#false} assume 0 == #t~ret17;havoc #t~ret17; {2021#false} is VALID [2018-11-23 12:54:38,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2018-11-23 12:54:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:38,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:38,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:38,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:38,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:38,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:38,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:39,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2018-11-23 12:54:39,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2020#true} is VALID [2018-11-23 12:54:39,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:54:39,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #58#return; {2020#true} is VALID [2018-11-23 12:54:39,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret18 := main(); {2020#true} is VALID [2018-11-23 12:54:39,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {2020#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {2049#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:39,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {2049#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2049#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:39,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {2049#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:39,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {2023#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:39,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:39,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {2024#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:39,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {2024#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:39,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {2025#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:39,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {2025#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:39,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {2026#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:39,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {2026#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:39,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {2027#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:39,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {2027#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:39,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:39,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(<= main_~j~0 6)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:39,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {2029#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:39,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#(<= main_~j~0 7)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2030#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:39,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {2030#(<= main_~j~0 8)} assume !(~j~0 < 10); {2021#false} is VALID [2018-11-23 12:54:39,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2021#false} is VALID [2018-11-23 12:54:39,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {2021#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {2021#false} is VALID [2018-11-23 12:54:39,016 INFO L273 TraceCheckUtils]: 25: Hoare triple {2021#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {2021#false} is VALID [2018-11-23 12:54:39,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {2021#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {2021#false} is VALID [2018-11-23 12:54:39,017 INFO L256 TraceCheckUtils]: 27: Hoare triple {2021#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2021#false} is VALID [2018-11-23 12:54:39,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {2021#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {2021#false} is VALID [2018-11-23 12:54:39,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {2021#false} assume true; {2021#false} is VALID [2018-11-23 12:54:39,017 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2021#false} {2021#false} #62#return; {2021#false} is VALID [2018-11-23 12:54:39,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {2021#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2021#false} is VALID [2018-11-23 12:54:39,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {2021#false} assume 0 == #t~ret17;havoc #t~ret17; {2021#false} is VALID [2018-11-23 12:54:39,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2018-11-23 12:54:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:39,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:39,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:54:39,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 12:54:39,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:39,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:54:39,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:39,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:54:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:54:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:39,095 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-11-23 12:54:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:39,606 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 12:54:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:54:39,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 12:54:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-23 12:54:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-23 12:54:39,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2018-11-23 12:54:39,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:39,675 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:54:39,675 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:54:39,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:54:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 12:54:39,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:39,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 12:54:39,703 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 12:54:39,703 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 12:54:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:39,705 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:54:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:54:39,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:39,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:39,706 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 12:54:39,706 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 12:54:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:39,707 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:54:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:54:39,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:39,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:39,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:39,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:54:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 12:54:39,709 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-11-23 12:54:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:39,709 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 12:54:39,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:54:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:54:39,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:54:39,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:39,710 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:39,710 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:39,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash -5504323, now seen corresponding path program 9 times [2018-11-23 12:54:39,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:39,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:39,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:40,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {2336#true} call ULTIMATE.init(); {2336#true} is VALID [2018-11-23 12:54:40,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {2336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2336#true} is VALID [2018-11-23 12:54:40,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {2336#true} assume true; {2336#true} is VALID [2018-11-23 12:54:40,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2336#true} {2336#true} #58#return; {2336#true} is VALID [2018-11-23 12:54:40,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {2336#true} call #t~ret18 := main(); {2336#true} is VALID [2018-11-23 12:54:40,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {2336#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {2338#(= main_~j~0 0)} is VALID [2018-11-23 12:54:40,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {2338#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2338#(= main_~j~0 0)} is VALID [2018-11-23 12:54:40,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {2338#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:40,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {2339#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:40,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {2339#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:40,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {2340#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:40,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {2340#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:40,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:40,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {2341#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:40,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:40,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:40,593 INFO L273 TraceCheckUtils]: 16: Hoare triple {2343#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:40,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {2343#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:40,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {2344#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:40,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {2344#(<= main_~j~0 6)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:40,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {2345#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:40,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {2345#(<= main_~j~0 7)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:40,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {2346#(<= main_~j~0 8)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:40,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {2346#(<= main_~j~0 8)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2347#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:40,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {2347#(<= main_~j~0 9)} assume !(~j~0 < 10); {2337#false} is VALID [2018-11-23 12:54:40,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {2337#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2337#false} is VALID [2018-11-23 12:54:40,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {2337#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {2337#false} is VALID [2018-11-23 12:54:40,599 INFO L273 TraceCheckUtils]: 27: Hoare triple {2337#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {2337#false} is VALID [2018-11-23 12:54:40,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {2337#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {2337#false} is VALID [2018-11-23 12:54:40,599 INFO L256 TraceCheckUtils]: 29: Hoare triple {2337#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2336#true} is VALID [2018-11-23 12:54:40,600 INFO L273 TraceCheckUtils]: 30: Hoare triple {2336#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {2336#true} is VALID [2018-11-23 12:54:40,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {2336#true} assume true; {2336#true} is VALID [2018-11-23 12:54:40,600 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2336#true} {2337#false} #62#return; {2337#false} is VALID [2018-11-23 12:54:40,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {2337#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2337#false} is VALID [2018-11-23 12:54:40,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {2337#false} assume 0 == #t~ret17;havoc #t~ret17; {2337#false} is VALID [2018-11-23 12:54:40,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {2337#false} assume !false; {2337#false} is VALID [2018-11-23 12:54:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:40,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:40,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:40,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:55:00,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:55:00,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:55:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:00,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:55:00,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {2336#true} call ULTIMATE.init(); {2336#true} is VALID [2018-11-23 12:55:00,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {2336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2336#true} is VALID [2018-11-23 12:55:00,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {2336#true} assume true; {2336#true} is VALID [2018-11-23 12:55:00,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2336#true} {2336#true} #58#return; {2336#true} is VALID [2018-11-23 12:55:00,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {2336#true} call #t~ret18 := main(); {2336#true} is VALID [2018-11-23 12:55:00,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {2336#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {2366#(<= main_~j~0 0)} is VALID [2018-11-23 12:55:00,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {2366#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2366#(<= main_~j~0 0)} is VALID [2018-11-23 12:55:00,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {2366#(<= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:55:00,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {2339#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:55:00,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {2339#(<= main_~j~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:55:00,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {2340#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:55:00,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {2340#(<= main_~j~0 2)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:55:00,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:55:00,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {2341#(<= main_~j~0 3)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:55:00,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:55:00,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(<= main_~j~0 4)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:55:00,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {2343#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:55:00,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {2343#(<= main_~j~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:55:00,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {2344#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:55:00,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {2344#(<= main_~j~0 6)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:55:00,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {2345#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:55:00,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {2345#(<= main_~j~0 7)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:55:00,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {2346#(<= main_~j~0 8)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:55:00,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {2346#(<= main_~j~0 8)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2347#(<= main_~j~0 9)} is VALID [2018-11-23 12:55:00,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {2347#(<= main_~j~0 9)} assume !(~j~0 < 10); {2337#false} is VALID [2018-11-23 12:55:00,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {2337#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2337#false} is VALID [2018-11-23 12:55:00,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {2337#false} assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; {2337#false} is VALID [2018-11-23 12:55:00,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {2337#false} call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); {2337#false} is VALID [2018-11-23 12:55:00,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {2337#false} assume !(~i~0 < #t~mem15);havoc #t~mem15; {2337#false} is VALID [2018-11-23 12:55:00,727 INFO L256 TraceCheckUtils]: 29: Hoare triple {2337#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2337#false} is VALID [2018-11-23 12:55:00,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {2337#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; {2337#false} is VALID [2018-11-23 12:55:00,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {2337#false} assume true; {2337#false} is VALID [2018-11-23 12:55:00,728 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2337#false} {2337#false} #62#return; {2337#false} is VALID [2018-11-23 12:55:00,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {2337#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2337#false} is VALID [2018-11-23 12:55:00,729 INFO L273 TraceCheckUtils]: 34: Hoare triple {2337#false} assume 0 == #t~ret17;havoc #t~ret17; {2337#false} is VALID [2018-11-23 12:55:00,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {2337#false} assume !false; {2337#false} is VALID [2018-11-23 12:55:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:55:00,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:55:00,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:55:00,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:55:00,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:00,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:55:00,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:00,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:55:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:55:00,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:55:00,815 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-23 12:55:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:01,207 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 12:55:01,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:55:01,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:55:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:55:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-23 12:55:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:55:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-23 12:55:01,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 53 transitions. [2018-11-23 12:55:01,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:01,283 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:55:01,283 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:55:01,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:55:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:55:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:55:01,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:01,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 12:55:01,328 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:55:01,328 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:55:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:01,329 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:55:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:55:01,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:01,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:01,330 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:55:01,330 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:55:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:01,331 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:55:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:55:01,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:01,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:01,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:01,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:55:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:55:01,333 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-11-23 12:55:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:01,333 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:55:01,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:55:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:55:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:55:01,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:01,333 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:01,334 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:01,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1671822879, now seen corresponding path program 10 times [2018-11-23 12:55:01,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:01,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:01,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:55:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:55:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:55:01,840 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=62, |#NULL.offset|=89, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem11|=1, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem15|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~i~0 < #t~mem15);havoc #t~mem15; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume 0 == #t~ret17;havoc #t~ret17; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !false; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] ----- [2018-11-23 12:55:01,970 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:01,971 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2018-11-23 12:55:01,972 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2018-11-23 12:55:01,974 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2018-11-23 12:55:01,974 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:55:01,974 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:55:01,974 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:55:01,974 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2018-11-23 12:55:01,974 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2018-11-23 12:55:01,974 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2018-11-23 12:55:01,975 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2018-11-23 12:55:01,976 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2018-11-23 12:55:01,976 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2018-11-23 12:55:01,976 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2018-11-23 12:55:01,976 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2018-11-23 12:55:01,976 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:55:01,976 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2018-11-23 12:55:01,976 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2018-11-23 12:55:01,976 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:55:01,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:01 BoogieIcfgContainer [2018-11-23 12:55:01,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:55:01,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:55:01,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:55:01,980 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:55:01,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:23" (3/4) ... [2018-11-23 12:55:01,983 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=62, |#NULL.offset|=89, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem11|=1, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem15|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~i~0 < #t~mem15);havoc #t~mem15; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume 0 == #t~ret17;havoc #t~ret17; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !false; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem9; [L37] havoc #t~mem8; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem3; [L17] havoc #t~mem1; [L17] havoc #t~mem0; [L17] havoc #t~mem2; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] ----- [2018-11-23 12:55:02,117 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test27_false-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:55:02,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:55:02,119 INFO L168 Benchmark]: Toolchain (without parser) took 40566.04 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -285.5 MB). Peak memory consumption was 568.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:02,121 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:02,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:02,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:02,122 INFO L168 Benchmark]: Boogie Preprocessor took 46.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:02,122 INFO L168 Benchmark]: RCFGBuilder took 1140.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -743.1 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:02,123 INFO L168 Benchmark]: TraceAbstraction took 38805.87 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 432.6 MB). Peak memory consumption was 561.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:02,124 INFO L168 Benchmark]: Witness Printer took 138.40 ms. Allocated memory is still 2.4 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:02,127 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 398.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1140.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -743.1 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38805.87 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 432.6 MB). Peak memory consumption was 561.1 MB. Max. memory is 7.1 GB. * Witness Printer took 138.40 ms. Allocated memory is still 2.4 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 51]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 38.7s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 55 SDslu, 850 SDs, 0 SdLazy, 189 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 25.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 25833 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 0/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...