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_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test07_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:25,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:25,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:25,414 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:25,414 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:25,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:25,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:25,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:25,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:25,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:25,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:25,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:25,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:25,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:25,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:25,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:25,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:25,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:25,452 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:25,457 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:25,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:25,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:25,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:25,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:25,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:25,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:25,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:25,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:25,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:25,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:25,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:25,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:25,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:25,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:25,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:25,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:25,483 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:07:25,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:25,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:25,512 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:25,512 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:25,513 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:25,513 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:25,513 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:25,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:25,514 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:25,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:25,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:25,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:25,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:25,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:25,515 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:25,515 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:25,517 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:25,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:25,517 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:25,517 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:25,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:25,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:25,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:25,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:25,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:25,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:25,519 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:25,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:25,520 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:25,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:25,520 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:25,520 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:25,520 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:25,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:25,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:25,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:25,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:25,602 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:25,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test07_true-unreach-call_true-termination.c [2018-11-23 11:07:25,671 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8fe9419/8895ab8e645a41a1acb09765067a8aca/FLAG6a5f10b7f [2018-11-23 11:07:26,145 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:26,146 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test07_true-unreach-call_true-termination.c [2018-11-23 11:07:26,151 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8fe9419/8895ab8e645a41a1acb09765067a8aca/FLAG6a5f10b7f [2018-11-23 11:07:26,499 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8fe9419/8895ab8e645a41a1acb09765067a8aca [2018-11-23 11:07:26,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:26,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:26,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:26,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:26,517 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:26,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7098ea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26, skipping insertion in model container [2018-11-23 11:07:26,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:26,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:26,779 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:26,800 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:26,825 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:26,852 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:26,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26 WrapperNode [2018-11-23 11:07:26,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:26,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:26,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:26,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:26,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:26,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:26,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:26,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:26,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (1/1) ... [2018-11-23 11:07:26,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:26,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:26,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:26,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:26,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07: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 11:07:27,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:27,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:27,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:27,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:27,102 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 11:07:27,102 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 11:07:27,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:27,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:27,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:27,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-23 11:07:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:27,678 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:27,679 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:07:27,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:27 BoogieIcfgContainer [2018-11-23 11:07:27,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:27,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:27,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:27,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:27,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:26" (1/3) ... [2018-11-23 11:07:27,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b99efe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:27, skipping insertion in model container [2018-11-23 11:07:27,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:26" (2/3) ... [2018-11-23 11:07:27,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b99efe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:27, skipping insertion in model container [2018-11-23 11:07:27,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:27" (3/3) ... [2018-11-23 11:07:27,688 INFO L112 eAbstractionObserver]: Analyzing ICFG test07_true-unreach-call_true-termination.c [2018-11-23 11:07:27,698 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:27,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:27,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:27,750 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:27,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:27,751 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:27,751 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:27,751 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:27,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:27,752 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:27,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:27,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:07:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:07:27,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:27,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:27,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:27,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1889415219, now seen corresponding path program 1 times [2018-11-23 11:07:27,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:27,791 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:27,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:27,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:28,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:07:28,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);~p1~0.base, ~p1~0.offset := 0bv32, 0bv32;~p2~0.base, ~p2~0.offset := 0bv32, 0bv32; {22#true} is VALID [2018-11-23 11:07:28,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:07:28,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #23#return; {22#true} is VALID [2018-11-23 11:07:28,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret7 := main(); {22#true} is VALID [2018-11-23 11:07:28,534 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~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post4 := #t~mem3;call write~intINTTYPE4(~bvsub32(#t~post4, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem3;havoc #t~post4; {22#true} is VALID [2018-11-23 11:07:28,535 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#true} call #t~ret5 := f(); {22#true} is VALID [2018-11-23 11:07:28,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#true} call #t~mem0 := read~intINTTYPE4(~p1~0.base, ~p1~0.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(~p2~0.base, ~p2~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);~v~0 := ~bvsub32(~bvadd32(#t~mem0, #t~mem1), #t~mem2);havoc #t~mem0;havoc #t~mem2;havoc #t~mem1; {22#true} is VALID [2018-11-23 11:07:28,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#true} assume 1bv32 == ~v~0;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;#res := ~v~0; {51#(and (= ~p2~0.base ~p1~0.base) (= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ~p1~0.offset ~p2~0.offset))} is VALID [2018-11-23 11:07:28,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {51#(and (= ~p2~0.base ~p1~0.base) (= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ~p1~0.offset ~p2~0.offset))} assume true; {51#(and (= ~p2~0.base ~p1~0.base) (= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ~p1~0.offset ~p2~0.offset))} is VALID [2018-11-23 11:07:28,548 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {51#(and (= ~p2~0.base ~p1~0.base) (= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ~p1~0.offset ~p2~0.offset))} {22#true} #27#return; {58#(and (= (_ bv1 32) |main_#t~ret5|) (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset))} is VALID [2018-11-23 11:07:28,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#(and (= (_ bv1 32) |main_#t~ret5|) (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset))} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {62#(and (= (_ bv1 32) |main_#t~mem6|) (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset))} is VALID [2018-11-23 11:07:28,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {62#(and (= (_ bv1 32) |main_#t~mem6|) (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset))} assume 0bv32 == #t~mem6 || ~p1~0.base != ~p2~0.base || ~p1~0.offset != ~p2~0.offset;havoc #t~mem6; {23#false} is VALID [2018-11-23 11:07:28,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:07:28,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 11:07:28,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:28,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:28,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:07:28,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:07:28,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:28,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:07:28,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:28,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:07:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:07:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:28,650 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-11-23 11:07:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:29,297 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 11:07:29,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:07:29,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:07:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:07:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-23 11:07:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:07:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-23 11:07:29,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2018-11-23 11:07:29,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:29,559 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:07:29,559 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:07:29,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:07:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:07:29,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:29,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:07:29,695 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:07:29,696 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:07:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:29,701 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 11:07:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 11:07:29,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:29,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:29,703 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:07:29,703 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:07:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:29,709 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 11:07:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 11:07:29,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:29,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:29,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:29,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:07:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2018-11-23 11:07:29,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2018-11-23 11:07:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:29,718 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2018-11-23 11:07:29,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:07:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 11:07:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:07:29,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:29,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:29,720 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:29,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1918044370, now seen corresponding path program 1 times [2018-11-23 11:07:29,722 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:29,722 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:29,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:29,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:29,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 11:07:29,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 11:07:29,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:29,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:29,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:29,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-11-23 11:07:30,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 11:07:30,160 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 11:07:30,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:30,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:30,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-23 11:07:30,303 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 18 treesize of output 16 [2018-11-23 11:07:30,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:30,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:30,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:30,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:30,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:44, output treesize:27 [2018-11-23 11:07:30,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {157#true} call ULTIMATE.init(); {157#true} is VALID [2018-11-23 11:07:30,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);~p1~0.base, ~p1~0.offset := 0bv32, 0bv32;~p2~0.base, ~p2~0.offset := 0bv32, 0bv32; {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} assume true; {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} {157#true} #23#return; {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} call #t~ret7 := main(); {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {165#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} ~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~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post4 := #t~mem3;call write~intINTTYPE4(~bvsub32(#t~post4, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem3;havoc #t~post4; {178#(and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,942 INFO L256 TraceCheckUtils]: 6: Hoare triple {178#(and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} call #t~ret5 := f(); {182#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {182#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} call #t~mem0 := read~intINTTYPE4(~p1~0.base, ~p1~0.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(~p2~0.base, ~p2~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);~v~0 := ~bvsub32(~bvadd32(#t~mem0, #t~mem1), #t~mem2);havoc #t~mem0;havoc #t~mem2;havoc #t~mem1; {186#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= f_~v~0 (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {186#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= f_~v~0 (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} assume !(1bv32 == ~v~0);#res := 0bv32; {190#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} assume true; {190#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:30,968 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {190#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} {178#(and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} #27#return; {158#false} is VALID [2018-11-23 11:07:30,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {158#false} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {158#false} is VALID [2018-11-23 11:07:30,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#false} assume 0bv32 == #t~mem6 || ~p1~0.base != ~p2~0.base || ~p1~0.offset != ~p2~0.offset;havoc #t~mem6; {158#false} is VALID [2018-11-23 11:07:30,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {158#false} assume !false; {158#false} is VALID [2018-11-23 11:07:30,972 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 11:07:30,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:30,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:30,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:07:30,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-23 11:07:30,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:30,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:07:31,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:31,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:07:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:07:31,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:07:31,033 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 7 states. [2018-11-23 11:07:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:31,514 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 11:07:31,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:07:31,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-23 11:07:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:07:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-23 11:07:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:07:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-23 11:07:31,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 14 transitions. [2018-11-23 11:07:31,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:31,548 INFO L225 Difference]: With dead ends: 15 [2018-11-23 11:07:31,548 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:07:31,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:07:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:07:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:07:31,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:31,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:31,551 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:31,552 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:31,552 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:07:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:07:31,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:31,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:31,553 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:31,553 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:31,554 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:07:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:07:31,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:31,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:31,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:31,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:07:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:07:31,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-11-23 11:07:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:31,556 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:07:31,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:07:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:07:31,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:31,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:07:31,744 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 11:07:32,040 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-23 11:07:32,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:07:32,065 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:07:32,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:07:32,066 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 14) no Hoare annotation was computed. [2018-11-23 11:07:32,066 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 7 15) no Hoare annotation was computed. [2018-11-23 11:07:32,067 INFO L444 ceAbstractionStarter]: At program point fENTRY(lines 7 15) the Hoare annotation is: (or (not (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) (not (= |~#a~0.offset| (_ bv0 32))) (not (= ~p2~0.offset (_ bv0 32))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |~#a~0.base| |~#b~0.base|) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base)) (not (= (_ bv0 32) |~#b~0.offset|)) (not (= |~#a~0.offset| |old(~p1~0.offset)|)) (not (= (_ bv1 32) (select (select |#memory_int| ~p2~0.base) (_ bv0 32))))) [2018-11-23 11:07:32,067 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 7 15) no Hoare annotation was computed. [2018-11-23 11:07:32,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:07:32,067 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|)) [2018-11-23 11:07:32,067 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:07:32,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:07:32,068 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 37) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (= |~#a~0.base| |~#b~0.base|) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-23 11:07:32,068 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2018-11-23 11:07:32,068 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-23 11:07:32,068 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2018-11-23 11:07:32,068 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2018-11-23 11:07:32,069 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))) (= |~#a~0.base| |~#b~0.base|) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-23 11:07:32,069 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-23 11:07:32,069 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2018-11-23 11:07:32,071 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:07:32,071 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-23 11:07:32,090 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:07:32,090 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-23 11:07:32,090 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-23 11:07:32,090 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:07:32,090 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 11:07:32,092 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:07:32,092 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-23 11:07:32,092 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:07:32,092 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 11:07:32,092 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 11:07:32,092 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:07:32,092 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:07:32,093 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:07:32,093 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:07:32,093 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:07:32,093 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:07:32,093 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-23 11:07:32,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:07:32 BoogieIcfgContainer [2018-11-23 11:07:32,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:07:32,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:07:32,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:07:32,105 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:07:32,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:27" (3/4) ... [2018-11-23 11:07:32,110 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:07:32,116 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:07:32,117 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-23 11:07:32,117 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:07:32,122 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 11:07:32,122 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 11:07:32,123 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:07:32,176 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test07_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 11:07:32,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:07:32,178 INFO L168 Benchmark]: Toolchain (without parser) took 5666.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -519.8 MB). Peak memory consumption was 214.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:32,179 INFO L168 Benchmark]: CDTParser took 0.23 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 11:07:32,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:32,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:07:32,181 INFO L168 Benchmark]: Boogie Preprocessor took 40.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:07:32,181 INFO L168 Benchmark]: RCFGBuilder took 747.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:32,182 INFO L168 Benchmark]: TraceAbstraction took 4423.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 236.6 MB). Peak memory consumption was 236.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:32,182 INFO L168 Benchmark]: Witness Printer took 71.79 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:07:32,186 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.23 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.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.99 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 747.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4423.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 236.6 MB). Peak memory consumption was 236.6 MB. Max. memory is 7.1 GB. * Witness Printer took 71.79 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: 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 == 0bv32) || a == b) || !(0bv32 == b) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 4 SDslu, 37 SDs, 0 SdLazy, 38 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 113 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 3991 SizeOfPredicates, 18 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 22 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...