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/list-properties/splice_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:24,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:24,384 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:24,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:24,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:24,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:24,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:24,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:24,421 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:24,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:24,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:24,423 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:24,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:24,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:24,429 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:24,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:24,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:24,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:24,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:24,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:24,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:24,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:24,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:24,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:24,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:24,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:24,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:24,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:24,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:24,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:24,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:24,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:24,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:24,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:24,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:24,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:24,470 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:53:24,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:24,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:24,500 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:24,500 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:24,503 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:24,503 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:24,503 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:24,504 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:24,504 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:24,504 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:24,504 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:24,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:24,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:24,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:24,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:24,505 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:24,505 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:24,507 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:24,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:24,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:24,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:24,508 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:24,508 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:24,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:24,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:24,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:24,509 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:24,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:24,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:24,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:24,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:24,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:24,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:24,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:24,576 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:24,577 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:24,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:24,644 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf61964b3/132be0d2ffe24798b733b58da910ad29/FLAG25b63cb0c [2018-11-23 12:53:25,183 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:25,184 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:25,201 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf61964b3/132be0d2ffe24798b733b58da910ad29/FLAG25b63cb0c [2018-11-23 12:53:25,469 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf61964b3/132be0d2ffe24798b733b58da910ad29 [2018-11-23 12:53:25,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:25,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:25,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:25,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:25,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:25,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:25,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8831bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:25, skipping insertion in model container [2018-11-23 12:53:25,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:25" (1/1) ... [2018-11-23 12:53:25,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:25,555 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:25,951 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:25,969 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:26,043 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:26,108 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:26,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26 WrapperNode [2018-11-23 12:53:26,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:26,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:26,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:26,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:26,194 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:53:26" (1/1) ... [2018-11-23 12:53:26,216 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:53:26" (1/1) ... [2018-11-23 12:53:26,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:26,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:26,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:26,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:26,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (1/1) ... [2018-11-23 12:53:26,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (1/1) ... [2018-11-23 12:53:26,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (1/1) ... [2018-11-23 12:53:26,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (1/1) ... [2018-11-23 12:53:26,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (1/1) ... [2018-11-23 12:53:26,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (1/1) ... [2018-11-23 12:53:26,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (1/1) ... [2018-11-23 12:53:26,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:26,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:26,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:26,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:26,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (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:53:26,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:53:26,352 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:53:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:26,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:26,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:53:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:53:26,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:26,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:27,281 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:27,281 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:53:27,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:27 BoogieIcfgContainer [2018-11-23 12:53:27,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:27,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:27,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:27,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:27,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:25" (1/3) ... [2018-11-23 12:53:27,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2dd4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:27, skipping insertion in model container [2018-11-23 12:53:27,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:26" (2/3) ... [2018-11-23 12:53:27,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2dd4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:27, skipping insertion in model container [2018-11-23 12:53:27,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:27" (3/3) ... [2018-11-23 12:53:27,290 INFO L112 eAbstractionObserver]: Analyzing ICFG splice_true-unreach-call_false-valid-memtrack.i [2018-11-23 12:53:27,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:27,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:27,328 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:27,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:27,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:27,364 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:27,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:27,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:27,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:27,366 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:27,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:27,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:53:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:53:27,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:27,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:27,394 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:27,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1069133742, now seen corresponding path program 1 times [2018-11-23 12:53:27,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:27,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:27,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:27,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:53:27,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 12:53:27,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:53:27,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #112#return; {39#true} is VALID [2018-11-23 12:53:27,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret11 := main(); {39#true} is VALID [2018-11-23 12:53:27,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {39#true} is VALID [2018-11-23 12:53:27,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {39#true} is VALID [2018-11-23 12:53:27,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {39#true} is VALID [2018-11-23 12:53:27,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:53:27,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {40#false} is VALID [2018-11-23 12:53:27,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {40#false} is VALID [2018-11-23 12:53:27,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 12:53:27,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {40#false} is VALID [2018-11-23 12:53:27,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {40#false} is VALID [2018-11-23 12:53:27,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume 1 != #t~mem7;havoc #t~mem7; {40#false} is VALID [2018-11-23 12:53:27,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:53:27,557 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:53:27,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:27,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:53:27,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:53:27,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:27,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:53:27,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:27,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:53:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:53:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:27,686 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:53:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:28,037 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-11-23 12:53:28,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:53:28,038 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:53:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 12:53:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 12:53:28,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 12:53:28,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:28,454 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:53:28,454 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:53:28,460 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:53:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:53:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:53:28,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:28,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:28,534 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:28,534 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:28,539 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 12:53:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 12:53:28,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:28,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:28,540 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:28,540 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:28,545 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 12:53:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 12:53:28,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:28,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:28,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:28,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:53:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 12:53:28,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2018-11-23 12:53:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:28,551 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 12:53:28,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:53:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 12:53:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:53:28,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:28,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:28,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:28,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash 764108808, now seen corresponding path program 1 times [2018-11-23 12:53:28,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:28,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:28,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 12:53:28,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {204#true} is VALID [2018-11-23 12:53:28,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:53:28,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #112#return; {204#true} is VALID [2018-11-23 12:53:28,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret11 := main(); {204#true} is VALID [2018-11-23 12:53:28,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {204#true} is VALID [2018-11-23 12:53:28,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {204#true} is VALID [2018-11-23 12:53:28,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {204#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {204#true} is VALID [2018-11-23 12:53:28,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {204#true} is VALID [2018-11-23 12:53:28,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {204#true} is VALID [2018-11-23 12:53:28,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {204#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {204#true} is VALID [2018-11-23 12:53:28,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#true} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-23 12:53:28,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-23 12:53:28,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} assume !(3 != #t~mem5);havoc #t~mem5; {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-23 12:53:28,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {207#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:28,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {207#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {205#false} is VALID [2018-11-23 12:53:28,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {205#false} assume 1 != #t~mem7;havoc #t~mem7; {205#false} is VALID [2018-11-23 12:53:28,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 12:53:28,855 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:53:28,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:28,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:53:28,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:53:28,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:28,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:53:29,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:29,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:53:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:53:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:53:29,103 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2018-11-23 12:53:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:29,553 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-11-23 12:53:29,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:29,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:53:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:53:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:53:29,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 12:53:29,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:29,698 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:53:29,699 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:53:29,700 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:53:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:53:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-23 12:53:29,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:29,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2018-11-23 12:53:29,744 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2018-11-23 12:53:29,744 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2018-11-23 12:53:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:29,748 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 12:53:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:53:29,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:29,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:29,749 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2018-11-23 12:53:29,749 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2018-11-23 12:53:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:29,753 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 12:53:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:53:29,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:29,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:29,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:29,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:53:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:53:29,757 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2018-11-23 12:53:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:29,758 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:53:29,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:53:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:53:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:53:29,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:29,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:29,759 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:29,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -132517795, now seen corresponding path program 1 times [2018-11-23 12:53:29,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:29,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {389#true} call ULTIMATE.init(); {389#true} is VALID [2018-11-23 12:53:29,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {389#true} is VALID [2018-11-23 12:53:29,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {389#true} assume true; {389#true} is VALID [2018-11-23 12:53:29,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} #112#return; {389#true} is VALID [2018-11-23 12:53:29,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {389#true} call #t~ret11 := main(); {389#true} is VALID [2018-11-23 12:53:29,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {389#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {389#true} is VALID [2018-11-23 12:53:29,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {389#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {389#true} is VALID [2018-11-23 12:53:29,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {389#true} is VALID [2018-11-23 12:53:29,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {389#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {389#true} is VALID [2018-11-23 12:53:29,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {389#true} is VALID [2018-11-23 12:53:29,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {389#true} is VALID [2018-11-23 12:53:29,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {389#true} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:29,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:29,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume !(3 != #t~mem5);havoc #t~mem5; {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:29,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:29,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:29,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} ~p~0.base, ~p~0.offset := ~l2~0.base, ~l2~0.offset; {392#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:29,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {390#false} is VALID [2018-11-23 12:53:29,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {390#false} assume 2 != #t~mem9;havoc #t~mem9; {390#false} is VALID [2018-11-23 12:53:29,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {390#false} assume !false; {390#false} is VALID [2018-11-23 12:53:29,917 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:53:29,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:29,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:53:29,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:53:29,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:29,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:53:29,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:29,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:53:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:53:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:53:29,962 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2018-11-23 12:53:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,243 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 12:53:30,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:30,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:53:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:53:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:53:30,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2018-11-23 12:53:30,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:30,336 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:53:30,337 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:53:30,337 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:53:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:53:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 12:53:30,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:30,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 12:53:30,402 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 12:53:30,402 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 12:53:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,406 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 12:53:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 12:53:30,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:30,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:30,407 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 12:53:30,407 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 12:53:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:30,411 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 12:53:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 12:53:30,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:30,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:30,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:30,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:53:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-23 12:53:30,415 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2018-11-23 12:53:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:30,416 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-23 12:53:30,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:53:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 12:53:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:53:30,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:30,417 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] [2018-11-23 12:53:30,418 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:30,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:30,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1096605693, now seen corresponding path program 1 times [2018-11-23 12:53:30,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:30,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:30,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:30,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2018-11-23 12:53:30,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {608#true} is VALID [2018-11-23 12:53:30,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2018-11-23 12:53:30,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #112#return; {608#true} is VALID [2018-11-23 12:53:30,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret11 := main(); {608#true} is VALID [2018-11-23 12:53:30,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {608#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {608#true} is VALID [2018-11-23 12:53:30,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {608#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {608#true} is VALID [2018-11-23 12:53:30,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {608#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:30,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {611#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:53:30,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {611#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {612#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:30,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {612#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {613#(= |main_#t~mem5| 3)} is VALID [2018-11-23 12:53:30,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#(= |main_#t~mem5| 3)} assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {609#false} is VALID [2018-11-23 12:53:30,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {609#false} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {609#false} is VALID [2018-11-23 12:53:30,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {609#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {609#false} is VALID [2018-11-23 12:53:30,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {609#false} assume !(3 != #t~mem5);havoc #t~mem5; {609#false} is VALID [2018-11-23 12:53:30,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {609#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {609#false} is VALID [2018-11-23 12:53:30,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {609#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {609#false} is VALID [2018-11-23 12:53:30,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {609#false} assume 1 != #t~mem7;havoc #t~mem7; {609#false} is VALID [2018-11-23 12:53:30,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {609#false} assume !false; {609#false} is VALID [2018-11-23 12:53:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:30,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:30,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:53:30,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 12:53:30,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:30,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:53:30,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:30,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:53:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:53:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:30,648 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 6 states. [2018-11-23 12:53:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:31,161 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-23 12:53:31,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:53:31,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 12:53:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:53:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:53:31,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 12:53:31,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:31,329 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:53:31,329 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:53:31,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:53:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:53:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 12:53:31,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:31,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 12:53:31,374 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 12:53:31,374 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 12:53:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:31,377 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-23 12:53:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 12:53:31,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:31,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:31,379 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 12:53:31,379 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 12:53:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:31,382 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-23 12:53:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 12:53:31,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:31,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:31,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:31,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:53:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 12:53:31,388 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2018-11-23 12:53:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:31,388 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-23 12:53:31,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:53:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 12:53:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:53:31,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:31,390 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:31,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:31,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash -803094924, now seen corresponding path program 1 times [2018-11-23 12:53:31,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:31,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:31,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:31,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:31,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:31,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2018-11-23 12:53:31,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {870#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {870#true} is VALID [2018-11-23 12:53:31,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2018-11-23 12:53:31,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #112#return; {870#true} is VALID [2018-11-23 12:53:31,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret11 := main(); {870#true} is VALID [2018-11-23 12:53:31,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {870#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:31,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {872#(= main_~flag~0 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:31,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {872#(= main_~flag~0 1)} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:31,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {872#(= main_~flag~0 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:31,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {872#(= main_~flag~0 1)} assume !!(0 != #t~nondet1);havoc #t~nondet1; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:31,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {872#(= main_~flag~0 1)} assume !(0 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4);~flag~0 := 1; {871#false} is VALID [2018-11-23 12:53:31,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {871#false} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {871#false} is VALID [2018-11-23 12:53:31,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#false} assume !(~t~0.base == 0 && ~t~0.offset == 0); {871#false} is VALID [2018-11-23 12:53:31,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {871#false} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {871#false} is VALID [2018-11-23 12:53:31,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {871#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {871#false} is VALID [2018-11-23 12:53:31,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {871#false} assume !(0 != #t~nondet1);havoc #t~nondet1; {871#false} is VALID [2018-11-23 12:53:31,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {871#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:31,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {871#false} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {871#false} is VALID [2018-11-23 12:53:31,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {871#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:31,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {871#false} assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {871#false} is VALID [2018-11-23 12:53:31,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {871#false} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {871#false} is VALID [2018-11-23 12:53:31,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {871#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:31,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {871#false} assume !(3 != #t~mem5);havoc #t~mem5; {871#false} is VALID [2018-11-23 12:53:31,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {871#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {871#false} is VALID [2018-11-23 12:53:31,471 INFO L273 TraceCheckUtils]: 24: Hoare triple {871#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:31,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {871#false} assume 1 != #t~mem7;havoc #t~mem7; {871#false} is VALID [2018-11-23 12:53:31,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {871#false} assume !false; {871#false} is VALID [2018-11-23 12:53:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:53:31,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:31,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:31,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:53:31,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:31,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:31,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:31,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:31,522 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2018-11-23 12:53:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:31,743 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2018-11-23 12:53:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:31,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:53:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-23 12:53:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-23 12:53:31,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2018-11-23 12:53:31,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:31,902 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:53:31,903 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:53:31,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:53:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2018-11-23 12:53:31,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:31,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 47 states. [2018-11-23 12:53:31,930 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 47 states. [2018-11-23 12:53:31,930 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 47 states. [2018-11-23 12:53:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:31,933 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-23 12:53:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-11-23 12:53:31,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:31,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:31,934 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 57 states. [2018-11-23 12:53:31,934 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 57 states. [2018-11-23 12:53:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:31,937 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-23 12:53:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-11-23 12:53:31,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:31,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:31,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:31,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:53:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-23 12:53:31,941 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2018-11-23 12:53:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:31,941 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-23 12:53:31,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:53:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:53:31,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:31,943 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:31,943 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:31,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash 785252978, now seen corresponding path program 1 times [2018-11-23 12:53:31,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:31,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:31,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:32,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {1169#true} call ULTIMATE.init(); {1169#true} is VALID [2018-11-23 12:53:32,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {1169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1169#true} is VALID [2018-11-23 12:53:32,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {1169#true} assume true; {1169#true} is VALID [2018-11-23 12:53:32,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1169#true} {1169#true} #112#return; {1169#true} is VALID [2018-11-23 12:53:32,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {1169#true} call #t~ret11 := main(); {1169#true} is VALID [2018-11-23 12:53:32,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {1169#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1171#(and (= 0 main_~a~0.offset) (= main_~flag~0 (select |#valid| main_~a~0.base)))} is VALID [2018-11-23 12:53:32,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {1171#(and (= 0 main_~a~0.offset) (= main_~flag~0 (select |#valid| main_~a~0.base)))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1171#(and (= 0 main_~a~0.offset) (= main_~flag~0 (select |#valid| main_~a~0.base)))} is VALID [2018-11-23 12:53:32,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {1171#(and (= 0 main_~a~0.offset) (= main_~flag~0 (select |#valid| main_~a~0.base)))} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1172#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:32,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {1172#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1172#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:32,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {1172#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1; {1172#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:32,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {1172#(and (= main_~flag~0 (select |#valid| main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; {1173#(and (= 0 main_~a~0.offset) (not (= 0 (select |#valid| main_~p~0.base))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:32,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {1173#(and (= 0 main_~a~0.offset) (not (= 0 (select |#valid| main_~p~0.base))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:32,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:32,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1175#(and (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:32,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#(and (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1175#(and (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:32,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {1175#(and (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1175#(and (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:32,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {1175#(and (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {1176#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:32,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1177#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:32,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~p~0.offset))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {1177#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~p~0.offset))} is VALID [2018-11-23 12:53:32,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~p~0.offset))} assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1178#(= 1 (select (select |#memory_int| main_~t~0.base) main_~t~0.offset))} is VALID [2018-11-23 12:53:32,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {1178#(= 1 (select (select |#memory_int| main_~t~0.base) main_~t~0.offset))} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {1179#(= 1 (select (select |#memory_int| main_~l1~0.base) main_~l1~0.offset))} is VALID [2018-11-23 12:53:32,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {1179#(= 1 (select (select |#memory_int| main_~l1~0.base) main_~l1~0.offset))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {1179#(= 1 (select (select |#memory_int| main_~l1~0.base) main_~l1~0.offset))} is VALID [2018-11-23 12:53:32,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {1179#(= 1 (select (select |#memory_int| main_~l1~0.base) main_~l1~0.offset))} assume !(3 != #t~mem5);havoc #t~mem5; {1179#(= 1 (select (select |#memory_int| main_~l1~0.base) main_~l1~0.offset))} is VALID [2018-11-23 12:53:32,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {1179#(= 1 (select (select |#memory_int| main_~l1~0.base) main_~l1~0.offset))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {1180#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:32,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {1180#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {1181#(= |main_#t~mem7| 1)} is VALID [2018-11-23 12:53:32,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {1181#(= |main_#t~mem7| 1)} assume 1 != #t~mem7;havoc #t~mem7; {1170#false} is VALID [2018-11-23 12:53:32,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {1170#false} assume !false; {1170#false} is VALID [2018-11-23 12:53:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:32,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:32,495 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:53:32,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:32,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:32,687 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:53:32,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:32,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:32,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:53:32,701 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:32,702 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_11|]. (and (= |#valid| (store |v_#valid_11| main_~a~0.base 1)) (= main_~a~0.offset 0)) [2018-11-23 12:53:32,702 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0)) [2018-11-23 12:53:32,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-23 12:53:32,929 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 8 treesize of output 7 [2018-11-23 12:53:32,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:32,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:32,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:32,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 12:53:33,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:33,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:33,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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:53:33,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-23 12:53:33,274 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:53:33,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:33,285 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:53:33,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 12:53:33,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 12:53:33,447 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 8 treesize of output 7 [2018-11-23 12:53:33,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:53:33,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 12:53:33,482 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:33,482 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, main_~p~0.base, main_~p~0.offset]. (and (= (store |v_#memory_int_20| main_~p~0.base (store (select |v_#memory_int_20| main_~p~0.base) main_~p~0.offset 3)) |#memory_int|) (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= (select (select |v_#memory_int_20| main_~a~0.base) main_~a~0.offset) 1)) [2018-11-23 12:53:33,482 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~p~0.base, main_~p~0.offset]. (and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 12:53:33,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 12:53:33,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:53:33,977 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:53:33,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:33,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:34,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:53:34,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2018-11-23 12:53:34,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 12:53:34,347 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 11 treesize of output 3 [2018-11-23 12:53:34,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:34,358 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:53:34,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:34,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:34,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:34,375 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-23 12:53:34,377 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:34,377 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_subst_1, v_prenex_1, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (= 1 .cse0) (not (= main_~p~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)) (= |main_#t~mem7| .cse0))) [2018-11-23 12:53:34,377 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 |main_#t~mem7|) [2018-11-23 12:53:34,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {1169#true} call ULTIMATE.init(); {1169#true} is VALID [2018-11-23 12:53:34,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {1169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1169#true} is VALID [2018-11-23 12:53:34,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {1169#true} assume true; {1169#true} is VALID [2018-11-23 12:53:34,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1169#true} {1169#true} #112#return; {1169#true} is VALID [2018-11-23 12:53:34,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {1169#true} call #t~ret11 := main(); {1169#true} is VALID [2018-11-23 12:53:34,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {1169#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1200#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} is VALID [2018-11-23 12:53:34,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1200#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} is VALID [2018-11-23 12:53:34,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1207#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:34,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {1207#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1207#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:34,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {1207#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet1);havoc #t~nondet1; {1207#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:34,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {1207#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; {1217#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:53:34,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {1217#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:34,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:34,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {1174#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1227#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:34,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {1227#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1227#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:34,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {1227#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1227#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:34,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {1227#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {1237#(and (= 0 main_~a~0.offset) (exists ((main_~p~0.base Int) (main_~p~0.offset Int)) (and (not (= main_~a~0.base main_~p~0.base)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:53:34,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {1237#(and (= 0 main_~a~0.offset) (exists ((main_~p~0.base Int) (main_~p~0.offset Int)) (and (not (= main_~a~0.base main_~p~0.base)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1241#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~p~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:34,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {1241#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~p~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~p~0.offset 0))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {1241#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~p~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:34,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {1241#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~p~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~p~0.offset 0))} assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1248#(and (= 1 (select (select |#memory_int| main_~t~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~t~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~t~0.offset 0))} is VALID [2018-11-23 12:53:34,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {1248#(and (= 1 (select (select |#memory_int| main_~t~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~t~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~t~0.offset 0))} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {1252#(and (= 0 main_~l1~0.offset) (= 1 (select (select |#memory_int| main_~l1~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~l1~0.base v_subst_1)) (= (select (select |#memory_int| v_subst_1) v_prenex_1) 3))))} is VALID [2018-11-23 12:53:34,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {1252#(and (= 0 main_~l1~0.offset) (= 1 (select (select |#memory_int| main_~l1~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~l1~0.base v_subst_1)) (= (select (select |#memory_int| v_subst_1) v_prenex_1) 3))))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {1252#(and (= 0 main_~l1~0.offset) (= 1 (select (select |#memory_int| main_~l1~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~l1~0.base v_subst_1)) (= (select (select |#memory_int| v_subst_1) v_prenex_1) 3))))} is VALID [2018-11-23 12:53:34,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {1252#(and (= 0 main_~l1~0.offset) (= 1 (select (select |#memory_int| main_~l1~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~l1~0.base v_subst_1)) (= (select (select |#memory_int| v_subst_1) v_prenex_1) 3))))} assume !(3 != #t~mem5);havoc #t~mem5; {1252#(and (= 0 main_~l1~0.offset) (= 1 (select (select |#memory_int| main_~l1~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~l1~0.base v_subst_1)) (= (select (select |#memory_int| v_subst_1) v_prenex_1) 3))))} is VALID [2018-11-23 12:53:34,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {1252#(and (= 0 main_~l1~0.offset) (= 1 (select (select |#memory_int| main_~l1~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~l1~0.base v_subst_1)) (= (select (select |#memory_int| v_subst_1) v_prenex_1) 3))))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {1241#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~p~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:34,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {1241#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (exists ((v_prenex_1 Int) (v_subst_1 Int)) (and (not (= main_~p~0.base v_subst_1)) (= 3 (select (select |#memory_int| v_subst_1) v_prenex_1)))) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {1181#(= |main_#t~mem7| 1)} is VALID [2018-11-23 12:53:34,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {1181#(= |main_#t~mem7| 1)} assume 1 != #t~mem7;havoc #t~mem7; {1170#false} is VALID [2018-11-23 12:53:34,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {1170#false} assume !false; {1170#false} is VALID [2018-11-23 12:53:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:34,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:34,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-11-23 12:53:34,471 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 12:53:34,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:34,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:53:34,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:34,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:53:34,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:53:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:53:34,565 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 21 states. [2018-11-23 12:53:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:38,790 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-23 12:53:38,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:53:38,790 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 12:53:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:53:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2018-11-23 12:53:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:53:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2018-11-23 12:53:38,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 108 transitions. [2018-11-23 12:53:38,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:38,964 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:53:38,964 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:53:38,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:53:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:53:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-11-23 12:53:39,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:39,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 63 states. [2018-11-23 12:53:39,071 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 63 states. [2018-11-23 12:53:39,072 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 63 states. [2018-11-23 12:53:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:39,075 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-23 12:53:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-23 12:53:39,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:39,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:39,076 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 96 states. [2018-11-23 12:53:39,077 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 96 states. [2018-11-23 12:53:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:39,082 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-23 12:53:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-23 12:53:39,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:39,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:39,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:39,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:53:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2018-11-23 12:53:39,086 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2018-11-23 12:53:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:39,086 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-11-23 12:53:39,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:53:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2018-11-23 12:53:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:53:39,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:39,089 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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:53:39,089 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:39,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:39,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1286096883, now seen corresponding path program 1 times [2018-11-23 12:53:39,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:39,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:39,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:39,349 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:53:39,355 INFO L168 Benchmark]: Toolchain (without parser) took 13875.89 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 862.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -453.7 MB). Peak memory consumption was 408.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,357 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:53:39,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.89 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,359 INFO L168 Benchmark]: Boogie Preprocessor took 55.09 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:53:39,360 INFO L168 Benchmark]: RCFGBuilder took 1000.94 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: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,360 INFO L168 Benchmark]: TraceAbstraction took 12070.54 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.3 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.7 MB). Peak memory consumption was 420.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:39,365 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 628.89 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 115.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.09 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 1000.94 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: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12070.54 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.3 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.7 MB). Peak memory consumption was 420.0 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...