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/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:48,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:48,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:48,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:48,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:48,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:48,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:48,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:48,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:48,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:48,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:48,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:48,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:48,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:48,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:48,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:48,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:48,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:48,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:48,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:48,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:48,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:48,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:48,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:48,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:48,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:48,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:48,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:48,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:48,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:48,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:48,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:48,542 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:48,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:48,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:48,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:48,544 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:55:48,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:48,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:48,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:48,560 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:48,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:48,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:48,561 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:48,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:48,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:48,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:48,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:48,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:48,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:48,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:48,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:48,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:48,563 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:48,564 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:48,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:48,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:48,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:48,565 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:48,565 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:48,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:48,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:48,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:48,566 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:48,566 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:48,566 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:48,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:48,567 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:48,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:48,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:48,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:48,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:48,641 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:48,642 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:55:48,718 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d98f4ca3/cbb26c96a0ef485e9c9e9da5c83f879c/FLAG5228a75a1 [2018-11-23 12:55:49,269 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:49,269 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:55:49,294 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d98f4ca3/cbb26c96a0ef485e9c9e9da5c83f879c/FLAG5228a75a1 [2018-11-23 12:55:49,539 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d98f4ca3/cbb26c96a0ef485e9c9e9da5c83f879c [2018-11-23 12:55:49,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:49,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:49,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:49,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:49,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:49,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:49" (1/1) ... [2018-11-23 12:55:49,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515121ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:49, skipping insertion in model container [2018-11-23 12:55:49,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:49" (1/1) ... [2018-11-23 12:55:49,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:49,652 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:50,059 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:50,077 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:50,162 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:50,219 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:50,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50 WrapperNode [2018-11-23 12:55:50,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:50,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:50,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:50,221 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:50,299 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:55:50" (1/1) ... [2018-11-23 12:55:50,320 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:55:50" (1/1) ... [2018-11-23 12:55:50,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:50,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:50,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:50,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:50,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (1/1) ... [2018-11-23 12:55:50,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:50,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:50,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:50,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:50,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (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:55:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:50,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:50,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:50,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:50,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:50,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:50,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:50,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:51,531 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:51,532 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 12:55:51,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:51 BoogieIcfgContainer [2018-11-23 12:55:51,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:51,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:51,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:51,539 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:51,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:49" (1/3) ... [2018-11-23 12:55:51,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13764e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:51, skipping insertion in model container [2018-11-23 12:55:51,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (2/3) ... [2018-11-23 12:55:51,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13764e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:51, skipping insertion in model container [2018-11-23 12:55:51,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:51" (3/3) ... [2018-11-23 12:55:51,543 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:55:51,554 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:51,562 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 12:55:51,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 12:55:51,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:51,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:51,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:51,612 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:51,612 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:51,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:51,612 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:51,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:51,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:55:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:55:51,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:51,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:51,642 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:51,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1487743693, now seen corresponding path program 1 times [2018-11-23 12:55:51,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:51,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:51,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:51,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:51,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 12:55:51,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-23 12:55:51,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 12:55:51,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #155#return; {45#true} is VALID [2018-11-23 12:55:51,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret20 := main(); {45#true} is VALID [2018-11-23 12:55:51,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {45#true} is VALID [2018-11-23 12:55:51,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 12:55:51,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {46#false} is VALID [2018-11-23 12:55:51,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-23 12:55:51,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(~x~0.base != 0 || ~x~0.offset != 0); {46#false} is VALID [2018-11-23 12:55:51,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 12:55:51,834 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:55:51,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:51,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:51,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 12:55:51,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:51,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:51,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:51,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:52,012 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:55:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:52,510 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2018-11-23 12:55:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:52,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 12:55:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2018-11-23 12:55:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2018-11-23 12:55:52,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 118 transitions. [2018-11-23 12:55:53,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:53,190 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:55:53,191 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:55:53,194 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:55:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:55:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 12:55:53,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:53,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:53,239 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:53,239 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:53,244 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:55:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:55:53,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:53,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:53,246 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:53,246 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:55:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:53,251 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 12:55:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:55:53,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:53,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:53,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:53,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:55:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 12:55:53,257 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 11 [2018-11-23 12:55:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:53,258 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 12:55:53,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:55:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:55:53,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:53,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:53,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:53,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash 164594329, now seen corresponding path program 1 times [2018-11-23 12:55:53,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:53,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:53,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-23 12:55:53,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {254#true} is VALID [2018-11-23 12:55:53,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-23 12:55:53,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #155#return; {254#true} is VALID [2018-11-23 12:55:53,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret20 := main(); {254#true} is VALID [2018-11-23 12:55:53,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {254#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:53,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:53,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:53,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {257#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:53,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {257#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {258#(not |main_#t~short6|)} is VALID [2018-11-23 12:55:53,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {258#(not |main_#t~short6|)} assume #t~short6;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;#t~short6 := 0 != #t~nondet5; {255#false} is VALID [2018-11-23 12:55:53,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {255#false} assume !#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {255#false} is VALID [2018-11-23 12:55:53,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !(~x~0.base != 0 || ~x~0.offset != 0); {255#false} is VALID [2018-11-23 12:55:53,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-23 12:55:53,584 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:55:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:53,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:53,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:55:53,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:53,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:53,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:53,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:53,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:53,612 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 5 states. [2018-11-23 12:55:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,281 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2018-11-23 12:55:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:55:54,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:55:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:55:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:55:54,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-23 12:55:54,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:54,480 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:55:54,480 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:55:54,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:55:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-11-23 12:55:54,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:54,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 41 states. [2018-11-23 12:55:54,507 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 41 states. [2018-11-23 12:55:54,507 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 41 states. [2018-11-23 12:55:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,510 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:55:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:55:54,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:54,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:54,512 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 49 states. [2018-11-23 12:55:54,512 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 49 states. [2018-11-23 12:55:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,516 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:55:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:55:54,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:54,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:54,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:54,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:55:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:55:54,521 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 14 [2018-11-23 12:55:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:54,522 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:55:54,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:55:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:55:54,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:54,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:54,523 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:54,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash 164653911, now seen corresponding path program 1 times [2018-11-23 12:55:54,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:54,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:54,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:54,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2018-11-23 12:55:54,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {505#true} is VALID [2018-11-23 12:55:54,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2018-11-23 12:55:54,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #155#return; {505#true} is VALID [2018-11-23 12:55:54,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret20 := main(); {505#true} is VALID [2018-11-23 12:55:54,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {505#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {507#(not (= 0 main_~head~0.base))} is VALID [2018-11-23 12:55:54,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {507#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {507#(not (= 0 main_~head~0.base))} is VALID [2018-11-23 12:55:54,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {507#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {507#(not (= 0 main_~head~0.base))} is VALID [2018-11-23 12:55:54,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {507#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:54,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {508#(not (= 0 main_~x~0.base))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:54,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {508#(not (= 0 main_~x~0.base))} assume !#t~short6; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:54,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {508#(not (= 0 main_~x~0.base))} assume !#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {508#(not (= 0 main_~x~0.base))} is VALID [2018-11-23 12:55:54,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {508#(not (= 0 main_~x~0.base))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {506#false} is VALID [2018-11-23 12:55:54,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {506#false} assume !false; {506#false} is VALID [2018-11-23 12:55:54,669 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:55:54,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:54,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:55:54,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:55:54,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:54,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:55:54,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:54,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:55:54,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:55:54,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:55:54,692 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 4 states. [2018-11-23 12:55:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:54,992 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 12:55:54,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:55:54,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:55:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:55:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2018-11-23 12:55:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:55:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2018-11-23 12:55:54,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2018-11-23 12:55:55,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:55,159 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:55:55,159 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:55:55,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:55:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-23 12:55:55,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:55,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 48 states. [2018-11-23 12:55:55,219 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 48 states. [2018-11-23 12:55:55,219 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 48 states. [2018-11-23 12:55:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,223 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 12:55:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:55:55,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:55,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:55,224 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 54 states. [2018-11-23 12:55:55,225 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 54 states. [2018-11-23 12:55:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:55,228 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 12:55:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:55:55,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:55,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:55,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:55,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:55:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 12:55:55,232 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2018-11-23 12:55:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:55,233 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 12:55:55,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:55:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 12:55:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:55:55,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:55,234 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:55,235 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:55,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1416243916, now seen corresponding path program 1 times [2018-11-23 12:55:55,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:55,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:55,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:55,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:55,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:55,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-23 12:55:55,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {766#true} is VALID [2018-11-23 12:55:55,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-23 12:55:55,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #155#return; {766#true} is VALID [2018-11-23 12:55:55,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret20 := main(); {766#true} is VALID [2018-11-23 12:55:55,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:55,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:55,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(0, ~x~0.base, 4 + ~x~0.offset, 4); {766#true} is VALID [2018-11-23 12:55:55,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:55,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {766#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {766#true} is VALID [2018-11-23 12:55:55,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:55,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#true} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {768#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not |main_#t~short6|) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:55,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {768#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not |main_#t~short6|) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume #t~short6;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;#t~short6 := 0 != #t~nondet5; {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:55,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:55,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:55,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} goto; {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:55,393 INFO L273 TraceCheckUtils]: 16: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:55,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:55,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} assume #t~short6;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;#t~short6 := 0 != #t~nondet5; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:55,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} assume !#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:55,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {767#false} is VALID [2018-11-23 12:55:55,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-23 12:55:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:55:55,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:55:55,402 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:55:55,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:55,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:55:55,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 12:55:55,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:55:55,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:55,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:55,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 12:55:55,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 12:55:55,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:55,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:55,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 12:55:56,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 12:55:56,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 12:55:56,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:55:56,043 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,045 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:56,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:55:56,089 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-11-23 12:55:56,105 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:56,106 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_2, v_prenex_3, v_prenex_4, v_prenex_1, |#memory_$Pointer$.base|, v_main_~x~0.base_33, v_main_~x~0.offset_33, |#memory_$Pointer$.offset|]. (or (let ((.cse0 (select (select v_prenex_1 v_prenex_3) v_prenex_4))) (and (not (= 0 .cse0)) (= main_~x~0.offset (select (select v_prenex_2 v_prenex_3) v_prenex_4)) (= .cse0 main_~x~0.base))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_33) v_main_~x~0.offset_33))) (and (not (= 0 .cse1)) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_33) v_main_~x~0.offset_33) main_~x~0.base) (= main_~x~0.offset .cse1)))) [2018-11-23 12:55:56,106 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base))) [2018-11-23 12:55:56,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-23 12:55:56,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {766#true} is VALID [2018-11-23 12:55:56,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-23 12:55:56,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #155#return; {766#true} is VALID [2018-11-23 12:55:56,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret20 := main(); {766#true} is VALID [2018-11-23 12:55:56,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:56,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:56,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(0, ~x~0.base, 4 + ~x~0.offset, 4); {766#true} is VALID [2018-11-23 12:55:56,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {766#true} is VALID [2018-11-23 12:55:56,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {766#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {766#true} is VALID [2018-11-23 12:55:56,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {766#true} is VALID [2018-11-23 12:55:56,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#true} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {807#(or (and (or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0))) |main_#t~short6|) (and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not |main_#t~short6|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:56,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {807#(or (and (or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0))) |main_#t~short6|) (and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (not |main_#t~short6|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)))} assume #t~short6;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;#t~short6 := 0 != #t~nondet5; {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:56,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:56,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:56,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} goto; {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:56,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:56,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:56,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} assume #t~short6;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;#t~short6 := 0 != #t~nondet5; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:56,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} assume !#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} is VALID [2018-11-23 12:55:56,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {770#(or (not (= main_~x~0.offset 0)) (not (= 0 main_~x~0.base)))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {767#false} is VALID [2018-11-23 12:55:56,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-23 12:55:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:55:56,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:55:56,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:55:56,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:55:56,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:56,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:55:56,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:56,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:55:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:55:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:55:56,238 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 6 states. [2018-11-23 12:55:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:56,873 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-23 12:55:56,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:55:56,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:55:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:55:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-23 12:55:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:55:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-23 12:55:56,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2018-11-23 12:55:56,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:56,994 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:55:56,995 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:55:56,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:55:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:55:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-11-23 12:55:57,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:57,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 38 states. [2018-11-23 12:55:57,081 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 38 states. [2018-11-23 12:55:57,081 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 38 states. [2018-11-23 12:55:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,085 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-23 12:55:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-23 12:55:57,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:57,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:57,086 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 50 states. [2018-11-23 12:55:57,086 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 50 states. [2018-11-23 12:55:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,089 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-23 12:55:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-23 12:55:57,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:57,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:57,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:57,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:55:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:55:57,093 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 22 [2018-11-23 12:55:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:57,093 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:55:57,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:55:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:55:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:55:57,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:57,095 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, 1, 1, 1, 1] [2018-11-23 12:55:57,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:57,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash -9431534, now seen corresponding path program 1 times [2018-11-23 12:55:57,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:57,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:57,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:57,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:57,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-23 12:55:57,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1059#true} is VALID [2018-11-23 12:55:57,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-23 12:55:57,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #155#return; {1059#true} is VALID [2018-11-23 12:55:57,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret20 := main(); {1059#true} is VALID [2018-11-23 12:55:57,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {1059#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:57,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:57,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2018-11-23 12:55:57,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:57,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:57,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !#t~short6; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:57,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:57,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:57,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} goto; {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 12:55:57,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {1062#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); {1063#(and (= |main_#t~mem8.base| 0) (= |main_#t~mem8.offset| 0))} is VALID [2018-11-23 12:55:57,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {1063#(and (= |main_#t~mem8.base| 0) (= |main_#t~mem8.offset| 0))} assume !(#t~mem8.base == 0 && #t~mem8.offset == 0);havoc #t~mem8.base, #t~mem8.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem11.base, 4 + #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset; {1060#false} is VALID [2018-11-23 12:55:57,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {1060#false} ~prev~0.base, ~prev~0.offset := 0, 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1060#false} is VALID [2018-11-23 12:55:57,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {1060#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~next~0.base, ~next~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1060#false} is VALID [2018-11-23 12:55:57,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {1060#false} assume !(~x~0.base != 0 || ~x~0.offset != 0); {1060#false} is VALID [2018-11-23 12:55:57,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {1060#false} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1060#false} is VALID [2018-11-23 12:55:57,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {1060#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);~t1~0 := #t~mem13;havoc #t~mem13;~t2~0 := 0; {1060#false} is VALID [2018-11-23 12:55:57,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {1060#false} assume 2 == ~t1~0;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem15 := read~int(#t~mem14.base, 4 + #t~mem14.offset, 4);~t2~0 := #t~mem15;havoc #t~mem14.base, #t~mem14.offset;havoc #t~mem15; {1060#false} is VALID [2018-11-23 12:55:57,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {1060#false} assume !(2 != ~t1~0 || 1 == ~t2~0); {1060#false} is VALID [2018-11-23 12:55:57,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-23 12:55:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:55:57,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:57,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:57,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:55:57,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:57,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:57,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:57,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:57,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:57,447 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-23 12:55:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:57,895 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:55:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:55:57,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:55:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-23 12:55:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:55:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-23 12:55:57,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-23 12:55:58,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,070 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:55:58,070 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:55:58,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:55:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:55:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 12:55:58,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:58,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 12:55:58,172 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 12:55:58,172 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 12:55:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,174 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:55:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:55:58,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,175 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 12:55:58,175 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 12:55:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,177 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:55:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:55:58,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:58,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:58,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:58,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:55:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 12:55:58,182 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 24 [2018-11-23 12:55:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:58,182 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 12:55:58,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:55:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 12:55:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:55:58,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:58,184 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, 1, 1, 1, 1] [2018-11-23 12:55:58,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:58,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:58,184 INFO L82 PathProgramCache]: Analyzing trace with hash -689489904, now seen corresponding path program 1 times [2018-11-23 12:55:58,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:58,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:58,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:58,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:58,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {1285#true} call ULTIMATE.init(); {1285#true} is VALID [2018-11-23 12:55:58,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {1285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1285#true} is VALID [2018-11-23 12:55:58,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {1285#true} assume true; {1285#true} is VALID [2018-11-23 12:55:58,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1285#true} {1285#true} #155#return; {1285#true} is VALID [2018-11-23 12:55:58,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {1285#true} call #t~ret20 := main(); {1285#true} is VALID [2018-11-23 12:55:58,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {1285#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:58,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:58,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume !(0 != #t~nondet1);havoc #t~nondet1; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:58,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:58,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:58,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short6; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:58,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:58,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:58,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} goto; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:58,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:58,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume #t~mem8.base == 0 && #t~mem8.offset == 0;havoc #t~mem8.base, #t~mem8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(2, ~x~0.base, 4 + ~x~0.offset, 4); {1289#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))} is VALID [2018-11-23 12:55:58,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {1289#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))} ~prev~0.base, ~prev~0.offset := 0, 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1290#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0))} is VALID [2018-11-23 12:55:58,508 INFO L273 TraceCheckUtils]: 17: Hoare triple {1290#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0))} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~next~0.base, ~next~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1291#(not (= main_~x~0.base 0))} is VALID [2018-11-23 12:55:58,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {1291#(not (= main_~x~0.base 0))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {1286#false} is VALID [2018-11-23 12:55:58,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#false} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1286#false} is VALID [2018-11-23 12:55:58,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {1286#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);~t1~0 := #t~mem13;havoc #t~mem13;~t2~0 := 0; {1286#false} is VALID [2018-11-23 12:55:58,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {1286#false} assume 2 == ~t1~0;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem15 := read~int(#t~mem14.base, 4 + #t~mem14.offset, 4);~t2~0 := #t~mem15;havoc #t~mem14.base, #t~mem14.offset;havoc #t~mem15; {1286#false} is VALID [2018-11-23 12:55:58,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {1286#false} assume !(2 != ~t1~0 || 1 == ~t2~0); {1286#false} is VALID [2018-11-23 12:55:58,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {1286#false} assume !false; {1286#false} is VALID [2018-11-23 12:55:58,513 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:55:58,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:55:58,513 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:55:58,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:58,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:55:58,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 12:55:58,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 12:55:58,747 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:58,748 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (= |#valid| (store |v_#valid_15| main_~head~0.base 1)) [2018-11-23 12:55:58,748 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~head~0.base)) [2018-11-23 12:55:58,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:58,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:58,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 12:55:58,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 12:55:58,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:55:58,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 12:55:58,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 12:55:58,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:55:58,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:55:58,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,908 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,915 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:58,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:55:58,934 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:28 [2018-11-23 12:55:58,940 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:58,940 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_26|, |main_#t~malloc9.base|, main_~x~0.offset, |v_#valid_16|]. (and (= |#memory_$Pointer$.base| (let ((.cse0 (store |v_#memory_$Pointer$.base_26| main_~head~0.base (store (select |v_#memory_$Pointer$.base_26| main_~head~0.base) main_~head~0.offset |main_#t~malloc9.base|)))) (store .cse0 |main_#t~malloc9.base| (let ((.cse1 (+ main_~x~0.offset 4))) (store (store (select .cse0 |main_#t~malloc9.base|) main_~x~0.offset 0) .cse1 (select (select |#memory_$Pointer$.base| |main_#t~malloc9.base|) .cse1)))))) (= (select |v_#valid_16| |main_#t~malloc9.base|) 0) (= 1 (select |v_#valid_16| main_~head~0.base)) (not (= |main_#t~malloc9.base| 0))) [2018-11-23 12:55:58,940 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~x~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (and (not (= .cse0 main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| .cse0) main_~x~0.offset) 0) (not (= .cse0 0)))) [2018-11-23 12:55:59,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-23 12:55:59,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 12:55:59,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:59,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:55:59,060 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:55:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:59,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:55:59,071 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:9 [2018-11-23 12:55:59,074 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:55:59,074 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_27|, v_main_~x~0.offset_35, v_subst_1]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_27| main_~prev~0.base) v_main_~x~0.offset_35))) (and (= .cse0 main_~x~0.base) (not (= .cse0 0)) (not (= .cse0 main_~prev~0.base)) (= (select (select |v_#memory_$Pointer$.base_27| .cse0) v_subst_1) 0))) [2018-11-23 12:55:59,075 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= 0 main_~x~0.base)) (not (= main_~prev~0.base main_~x~0.base))) [2018-11-23 12:55:59,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {1285#true} call ULTIMATE.init(); {1285#true} is VALID [2018-11-23 12:55:59,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {1285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1285#true} is VALID [2018-11-23 12:55:59,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {1285#true} assume true; {1285#true} is VALID [2018-11-23 12:55:59,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1285#true} {1285#true} #155#return; {1285#true} is VALID [2018-11-23 12:55:59,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {1285#true} call #t~ret20 := main(); {1285#true} is VALID [2018-11-23 12:55:59,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {1285#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:59,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:59,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} assume !(0 != #t~nondet1);havoc #t~nondet1; {1287#(= (select |#valid| main_~head~0.base) 1)} is VALID [2018-11-23 12:55:59,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#(= (select |#valid| main_~head~0.base) 1)} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:59,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short6 := #t~mem4.base != 0 || #t~mem4.offset != 0; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:59,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short6; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:59,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !#t~short6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5;havoc #t~short6; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:59,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume !!(~x~0.base != 0 || ~x~0.offset != 0); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:59,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} goto; {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:59,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-23 12:55:59,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))} assume #t~mem8.base == 0 && #t~mem8.offset == 0;havoc #t~mem8.base, #t~mem8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);call write~int(2, ~x~0.base, 4 + ~x~0.offset, 4); {1340#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (exists ((main_~x~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) 0)))} is VALID [2018-11-23 12:55:59,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {1340#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (exists ((main_~x~0.offset Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset) 0)))} ~prev~0.base, ~prev~0.offset := 0, 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1344#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) v_subst_1) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2018-11-23 12:55:59,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {1344#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (exists ((v_subst_1 Int)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) v_subst_1) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~next~0.base, ~next~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1348#(and (not (= 0 main_~x~0.base)) (not (= main_~prev~0.base main_~x~0.base)))} is VALID [2018-11-23 12:55:59,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#(and (not (= 0 main_~x~0.base)) (not (= main_~prev~0.base main_~x~0.base)))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {1286#false} is VALID [2018-11-23 12:55:59,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#false} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1286#false} is VALID [2018-11-23 12:55:59,153 INFO L273 TraceCheckUtils]: 20: Hoare triple {1286#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);~t1~0 := #t~mem13;havoc #t~mem13;~t2~0 := 0; {1286#false} is VALID [2018-11-23 12:55:59,153 INFO L273 TraceCheckUtils]: 21: Hoare triple {1286#false} assume 2 == ~t1~0;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem15 := read~int(#t~mem14.base, 4 + #t~mem14.offset, 4);~t2~0 := #t~mem15;havoc #t~mem14.base, #t~mem14.offset;havoc #t~mem15; {1286#false} is VALID [2018-11-23 12:55:59,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {1286#false} assume !(2 != ~t1~0 || 1 == ~t2~0); {1286#false} is VALID [2018-11-23 12:55:59,154 INFO L273 TraceCheckUtils]: 23: Hoare triple {1286#false} assume !false; {1286#false} is VALID [2018-11-23 12:55:59,158 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:55:59,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:55:59,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 12:55:59,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:55:59,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:59,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:55:59,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:59,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:55:59,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:55:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:55:59,219 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 10 states. [2018-11-23 12:56:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,459 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2018-11-23 12:56:01,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:56:01,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 12:56:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2018-11-23 12:56:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:56:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2018-11-23 12:56:01,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2018-11-23 12:56:01,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,679 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:56:01,680 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:56:01,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:56:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:56:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 64. [2018-11-23 12:56:01,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:01,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 64 states. [2018-11-23 12:56:01,763 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 64 states. [2018-11-23 12:56:01,763 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 64 states. [2018-11-23 12:56:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,768 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-23 12:56:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-11-23 12:56:01,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:01,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:01,769 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 107 states. [2018-11-23 12:56:01,769 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 107 states. [2018-11-23 12:56:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,773 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-23 12:56:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-11-23 12:56:01,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:01,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:01,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:01,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:56:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-11-23 12:56:01,777 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 24 [2018-11-23 12:56:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:01,777 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-23 12:56:01,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:56:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-11-23 12:56:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:56:01,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:01,778 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:01,778 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:01,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1695473247, now seen corresponding path program 2 times [2018-11-23 12:56:01,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:01,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:02,210 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:56:02,217 INFO L168 Benchmark]: Toolchain (without parser) took 12664.37 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -644.8 MB). Peak memory consumption was 222.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:02,218 INFO L168 Benchmark]: CDTParser took 0.22 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:56:02,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:02,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:02,220 INFO L168 Benchmark]: Boogie Preprocessor took 71.74 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:02,221 INFO L168 Benchmark]: RCFGBuilder took 1122.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:02,222 INFO L168 Benchmark]: TraceAbstraction took 10680.21 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 90.2 MB). Peak memory consumption was 219.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:02,226 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.22 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 666.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 117.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.74 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1122.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10680.21 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 90.2 MB). Peak memory consumption was 219.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...