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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test09_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:46:56,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:46:56,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:46:56,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:46:56,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:46:56,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:46:56,404 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:46:56,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:46:56,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:46:56,412 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:46:56,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:46:56,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:46:56,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:46:56,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:46:56,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:46:56,418 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:46:56,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:46:56,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:46:56,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:46:56,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:46:56,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:46:56,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:46:56,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:46:56,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:46:56,441 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:46:56,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:46:56,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:46:56,447 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:46:56,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:46:56,452 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:46:56,452 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:46:56,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:46:56,455 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:46:56,455 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:46:56,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:46:56,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:46:56,457 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-18 23:46:56,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:46:56,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:46:56,487 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:46:56,487 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:46:56,487 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:46:56,488 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:46:56,488 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:46:56,488 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:46:56,488 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:46:56,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:46:56,490 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:46:56,490 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:46:56,490 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:46:56,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:46:56,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:46:56,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:46:56,491 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:46:56,491 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:46:56,491 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:46:56,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:46:56,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:46:56,493 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:46:56,493 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:46:56,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:46:56,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:46:56,494 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:46:56,494 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:46:56,494 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:46:56,494 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:46:56,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:46:56,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:46:56,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:46:56,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:46:56,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:46:56,569 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:46:56,570 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:46:56,570 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test09_true-unreach-call_true-termination.c [2018-11-18 23:46:56,630 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939f7b56e/f9ccddfc2a55406594258f307f5cb3f3/FLAG97902efdb [2018-11-18 23:46:57,107 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:46:57,107 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test09_true-unreach-call_true-termination.c [2018-11-18 23:46:57,114 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939f7b56e/f9ccddfc2a55406594258f307f5cb3f3/FLAG97902efdb [2018-11-18 23:46:57,468 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939f7b56e/f9ccddfc2a55406594258f307f5cb3f3 [2018-11-18 23:46:57,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:46:57,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:46:57,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:46:57,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:46:57,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:46:57,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcf46f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57, skipping insertion in model container [2018-11-18 23:46:57,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:46:57,515 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:46:57,760 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:46:57,774 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:46:57,794 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:46:57,818 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:46:57,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57 WrapperNode [2018-11-18 23:46:57,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:46:57,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:46:57,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:46:57,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:46:57,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (1/1) ... [2018-11-18 23:46:57,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:46:57,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:46:57,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:46:57,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:46:57,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (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-18 23:46:58,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:46:58,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:46:58,024 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-18 23:46:58,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:46:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:46:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-18 23:46:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:46:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:46:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:46:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:46:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:46:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:46:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:46:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:46:58,567 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:46:58,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:46:58 BoogieIcfgContainer [2018-11-18 23:46:58,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:46:58,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:46:58,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:46:58,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:46:58,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:46:57" (1/3) ... [2018-11-18 23:46:58,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e635a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:46:58, skipping insertion in model container [2018-11-18 23:46:58,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:46:57" (2/3) ... [2018-11-18 23:46:58,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e635a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:46:58, skipping insertion in model container [2018-11-18 23:46:58,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:46:58" (3/3) ... [2018-11-18 23:46:58,577 INFO L112 eAbstractionObserver]: Analyzing ICFG test09_true-unreach-call_true-termination.c [2018-11-18 23:46:58,587 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:46:58,595 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:46:58,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:46:58,642 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:46:58,643 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:46:58,643 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:46:58,644 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:46:58,644 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:46:58,644 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:46:58,644 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:46:58,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:46:58,645 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:46:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 23:46:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:46:58,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:46:58,671 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:46:58,674 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:46:58,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:46:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1889415219, now seen corresponding path program 1 times [2018-11-18 23:46:58,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:46:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:46:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:46:58,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:46:59,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-18 23:46:59,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {22#true} is VALID [2018-11-18 23:46:59,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-18 23:46:59,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #23#return; {22#true} is VALID [2018-11-18 23:46:59,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret7 := main(); {22#true} is VALID [2018-11-18 23:46:59,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~post4;havoc #t~mem3; {22#true} is VALID [2018-11-18 23:46:59,105 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#true} call #t~ret5 := f(); {22#true} is VALID [2018-11-18 23:46:59,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#true} call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);~v~0 := #t~mem0 + #t~mem1 - #t~mem2;havoc #t~mem0;havoc #t~mem2;havoc #t~mem1; {22#true} is VALID [2018-11-18 23:46:59,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#true} assume 1 == ~v~0;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;#res := ~v~0; {24#(and (= ~p1~0.base ~p2~0.base) (= ~p1~0.offset ~p2~0.offset))} is VALID [2018-11-18 23:46:59,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#(and (= ~p1~0.base ~p2~0.base) (= ~p1~0.offset ~p2~0.offset))} assume true; {24#(and (= ~p1~0.base ~p2~0.base) (= ~p1~0.offset ~p2~0.offset))} is VALID [2018-11-18 23:46:59,112 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {24#(and (= ~p1~0.base ~p2~0.base) (= ~p1~0.offset ~p2~0.offset))} {22#true} #27#return; {24#(and (= ~p1~0.base ~p2~0.base) (= ~p1~0.offset ~p2~0.offset))} is VALID [2018-11-18 23:46:59,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {24#(and (= ~p1~0.base ~p2~0.base) (= ~p1~0.offset ~p2~0.offset))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;call write~int(1000, ~p1~0.base, ~p1~0.offset, 4);call #t~mem6 := read~int(~p2~0.base, ~p2~0.offset, 4); {25#(= |main_#t~mem6| 1000)} is VALID [2018-11-18 23:46:59,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {25#(= |main_#t~mem6| 1000)} assume 1000 != #t~mem6;havoc #t~mem6; {23#false} is VALID [2018-11-18 23:46:59,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-18 23:46:59,140 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-18 23:46:59,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:46:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:46:59,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 23:46:59,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:46:59,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:46:59,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:59,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:46:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:46:59,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:46:59,214 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 4 states. [2018-11-18 23:46:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:59,654 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-18 23:46:59,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:46:59,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 23:46:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:46:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:46:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-18 23:46:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:46:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-18 23:46:59,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2018-11-18 23:46:59,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:59,943 INFO L225 Difference]: With dead ends: 33 [2018-11-18 23:46:59,943 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 23:46:59,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:46:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 23:47:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 23:47:00,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:47:00,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-18 23:47:00,025 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 23:47:00,026 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 23:47:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:47:00,030 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-18 23:47:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-18 23:47:00,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:47:00,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:47:00,031 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 23:47:00,031 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 23:47:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:47:00,034 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-18 23:47:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-18 23:47:00,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:47:00,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:47:00,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:47:00,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:47:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:47:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2018-11-18 23:47:00,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2018-11-18 23:47:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:47:00,040 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2018-11-18 23:47:00,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:47:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-18 23:47:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:47:00,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:47:00,041 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:47:00,042 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:47:00,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:47:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1918044370, now seen corresponding path program 1 times [2018-11-18 23:47:00,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:47:00,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:47:00,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:47:00,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:47:00,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:47:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:47:00,863 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-11-18 23:47:01,086 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-11-18 23:47:01,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {123#true} call ULTIMATE.init(); {123#true} is VALID [2018-11-18 23:47:01,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call write~unchecked~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4);call write~unchecked~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0; {125#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2018-11-18 23:47:01,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#(not (= |~#b~0.base| |~#a~0.base|))} assume true; {125#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2018-11-18 23:47:01,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#(not (= |~#b~0.base| |~#a~0.base|))} {123#true} #23#return; {125#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2018-11-18 23:47:01,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#(not (= |~#b~0.base| |~#a~0.base|))} call #t~ret7 := main(); {125#(not (= |~#b~0.base| |~#a~0.base|))} is VALID [2018-11-18 23:47:01,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#(not (= |~#b~0.base| |~#a~0.base|))} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~post4;havoc #t~mem3; {126#(and (= |~#a~0.offset| ~p1~0.offset) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1) (= |~#a~0.base| ~p1~0.base))} is VALID [2018-11-18 23:47:01,182 INFO L256 TraceCheckUtils]: 6: Hoare triple {126#(and (= |~#a~0.offset| ~p1~0.offset) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1) (= |~#a~0.base| ~p1~0.base))} call #t~ret5 := f(); {127#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} is VALID [2018-11-18 23:47:01,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {127#(and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))} call #t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call #t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);~v~0 := #t~mem0 + #t~mem1 - #t~mem2;havoc #t~mem0;havoc #t~mem2;havoc #t~mem1; {128#(or (and (or (and (or (not (= ~p1~0.base |~#a~0.base|)) (= |old(~p1~0.offset)| ~p1~0.offset)) (or (= ~p1~0.base |~#a~0.base|) (= |old(~p1~0.base)| ~p1~0.base))) (= (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))) (or (and (<= (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset)) (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) f_~v~0)) (<= f_~v~0 1)) (not (= (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))))) (not (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1)))} is VALID [2018-11-18 23:47:01,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {128#(or (and (or (and (or (not (= ~p1~0.base |~#a~0.base|)) (= |old(~p1~0.offset)| ~p1~0.offset)) (or (= ~p1~0.base |~#a~0.base|) (= |old(~p1~0.base)| ~p1~0.base))) (= (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))) (or (and (<= (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset)) (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) f_~v~0)) (<= f_~v~0 1)) (not (= (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))))) (not (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1)))} assume !(1 == ~v~0);#res := 0; {129#(or (and (or (<= (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) 2) (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))) (<= (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset)) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) (or (not (= ~p1~0.base |~#a~0.base|)) (= |old(~p1~0.offset)| ~p1~0.offset)) (or (= ~p1~0.base |~#a~0.base|) (= |old(~p1~0.base)| ~p1~0.base))) (not (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1)))} is VALID [2018-11-18 23:47:01,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {129#(or (and (or (<= (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) 2) (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))) (<= (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset)) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) (or (not (= ~p1~0.base |~#a~0.base|)) (= |old(~p1~0.offset)| ~p1~0.offset)) (or (= ~p1~0.base |~#a~0.base|) (= |old(~p1~0.base)| ~p1~0.base))) (not (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1)))} assume true; {129#(or (and (or (<= (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) 2) (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))) (<= (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset)) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) (or (not (= ~p1~0.base |~#a~0.base|)) (= |old(~p1~0.offset)| ~p1~0.offset)) (or (= ~p1~0.base |~#a~0.base|) (= |old(~p1~0.base)| ~p1~0.base))) (not (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1)))} is VALID [2018-11-18 23:47:01,192 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {129#(or (and (or (<= (+ (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|) 2) (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset))) (<= (+ (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset)) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) (or (not (= ~p1~0.base |~#a~0.base|)) (= |old(~p1~0.offset)| ~p1~0.offset)) (or (= ~p1~0.base |~#a~0.base|) (= |old(~p1~0.base)| ~p1~0.base))) (not (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1)))} {126#(and (= |~#a~0.offset| ~p1~0.offset) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1) (= |~#a~0.base| ~p1~0.base))} #27#return; {124#false} is VALID [2018-11-18 23:47:01,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {124#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;call write~int(1000, ~p1~0.base, ~p1~0.offset, 4);call #t~mem6 := read~int(~p2~0.base, ~p2~0.offset, 4); {124#false} is VALID [2018-11-18 23:47:01,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {124#false} assume 1000 != #t~mem6;havoc #t~mem6; {124#false} is VALID [2018-11-18 23:47:01,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {124#false} assume !false; {124#false} is VALID [2018-11-18 23:47:01,197 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-18 23:47:01,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:47:01,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 23:47:01,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-18 23:47:01,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:47:01,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:47:01,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:47:01,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:47:01,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:47:01,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:47:01,251 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 7 states. [2018-11-18 23:47:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:47:01,629 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-18 23:47:01,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:47:01,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-18 23:47:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:47:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:47:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-11-18 23:47:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:47:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-11-18 23:47:01,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2018-11-18 23:47:01,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:47:01,658 INFO L225 Difference]: With dead ends: 15 [2018-11-18 23:47:01,658 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:47:01,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:47:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:47:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:47:01,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:47:01,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:47:01,661 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:47:01,661 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:47:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:47:01,662 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:47:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:47:01,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:47:01,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:47:01,662 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:47:01,662 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:47:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:47:01,663 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:47:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:47:01,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:47:01,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:47:01,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:47:01,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:47:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:47:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:47:01,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-11-18 23:47:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:47:01,664 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:47:01,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:47:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:47:01,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:47:01,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:47:01,895 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:47:01,896 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|)) [2018-11-18 23:47:01,896 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:47:01,896 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 14) no Hoare annotation was computed. [2018-11-18 23:47:01,896 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 7 15) no Hoare annotation was computed. [2018-11-18 23:47:01,896 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 7 15) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= 1 (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (and (= ~p1~0.offset |old(~p1~0.offset)|) (= |~#a~0.base| ~p1~0.base)) (not (= |~#a~0.offset| |old(~p1~0.offset)|)) (not (= |old(~p1~0.base)| |~#a~0.base|))) [2018-11-18 23:47:01,896 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 7 15) no Hoare annotation was computed. [2018-11-18 23:47:01,896 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:47:01,897 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~p1~0.base ~p2~0.base) (not (= |~#b~0.base| |~#a~0.base|)) (= ~p1~0.offset ~p2~0.offset)) [2018-11-18 23:47:01,897 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:47:01,897 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:47:01,897 INFO L421 ceAbstractionStarter]: At program point L32(lines 17 39) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= |old(~p2~0.offset)| |old(~p1~0.offset)|)) (not (= |old(~p1~0.base)| |old(~p2~0.base)|))) [2018-11-18 23:47:01,897 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-18 23:47:01,898 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 17 39) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= |old(~p2~0.offset)| |old(~p1~0.offset)|)) (not (= |old(~p1~0.base)| |old(~p2~0.base)|)) (and (= ~p1~0.base ~p2~0.base) (= ~p1~0.offset ~p2~0.offset) (= ~p1~0.offset |old(~p1~0.offset)|) (= ~p1~0.base |old(~p1~0.base)|))) [2018-11-18 23:47:01,898 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 17 39) no Hoare annotation was computed. [2018-11-18 23:47:01,898 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-18 23:47:01,898 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (not (= |old(~p2~0.offset)| |old(~p1~0.offset)|)) (not (= |old(~p1~0.base)| |old(~p2~0.base)|)) (and (= |~#a~0.offset| ~p1~0.offset) (= (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) 1) (= |~#a~0.base| ~p1~0.base))) [2018-11-18 23:47:01,898 INFO L425 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-18 23:47:01,899 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 17 39) no Hoare annotation was computed. [2018-11-18 23:47:01,901 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:47:01,901 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 23:47:01,904 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:47:01,904 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 23:47:01,904 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 23:47:01,904 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:47:01,905 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-18 23:47:01,907 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:47:01,907 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-18 23:47:01,907 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:47:01,907 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-18 23:47:01,908 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-18 23:47:01,908 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-18 23:47:01,908 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-18 23:47:01,908 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 23:47:01,908 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:47:01,909 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:47:01,909 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:47:01,909 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:47:01,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:47:01 BoogieIcfgContainer [2018-11-18 23:47:01,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:47:01,923 INFO L168 Benchmark]: Toolchain (without parser) took 4445.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -559.8 MB). Peak memory consumption was 183.7 MB. Max. memory is 7.1 GB. [2018-11-18 23:47:01,924 INFO L168 Benchmark]: CDTParser took 0.21 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-18 23:47:01,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 23:47:01,926 INFO L168 Benchmark]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:47:01,926 INFO L168 Benchmark]: RCFGBuilder took 704.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:47:01,927 INFO L168 Benchmark]: TraceAbstraction took 3352.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 197.8 MB). Peak memory consumption was 197.8 MB. Max. memory is 7.1 GB. [2018-11-18 23:47:01,932 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.21 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 340.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 704.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3352.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 197.8 MB). Peak memory consumption was 197.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (a == b || !(\old(p2) == \old(p1))) || !(\old(p1) == \old(p2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 10 SDslu, 33 SDs, 0 SdLazy, 22 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 109 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 25 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 3536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...