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_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:14:15,003 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:14:15,005 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:14:15,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:14:15,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:14:15,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:14:15,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:14:15,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:14:15,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:14:15,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:14:15,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:14:15,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:14:15,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:14:15,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:14:15,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:14:15,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:14:15,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:14:15,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:14:15,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:14:15,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:14:15,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:14:15,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:14:15,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:14:15,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:14:15,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:14:15,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:14:15,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:14:15,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:14:15,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:14:15,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:14:15,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:14:15,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:14:15,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:14:15,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:14:15,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:14:15,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:14:15,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:14:15,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:14:15,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:14:15,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:14:15,115 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:14:15,116 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:14:15,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:14:15,117 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:14:15,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:14:15,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:14:15,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:14:15,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:14:15,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:14:15,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:14:15,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:14:15,118 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:14:15,118 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:14:15,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:14:15,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:14:15,120 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:14:15,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:14:15,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:14:15,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:14:15,121 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:14:15,121 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:14:15,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:14:15,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:14:15,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:14:15,122 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:14:15,122 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:14:15,122 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:14:15,122 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:14:15,123 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:14:15,123 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:14:15,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:14:15,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:14:15,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:14:15,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:14:15,191 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:14:15,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-14 18:14:15,250 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928a0c946/5a2f8a9c57fe4402bf4bbad3be09d45c/FLAG1dc3f8218 [2018-11-14 18:14:15,714 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:14:15,715 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-14 18:14:15,721 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928a0c946/5a2f8a9c57fe4402bf4bbad3be09d45c/FLAG1dc3f8218 [2018-11-14 18:14:15,735 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928a0c946/5a2f8a9c57fe4402bf4bbad3be09d45c [2018-11-14 18:14:15,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:14:15,748 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:14:15,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:15,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:14:15,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:14:15,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:15" (1/1) ... [2018-11-14 18:14:15,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c8276b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:15, skipping insertion in model container [2018-11-14 18:14:15,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:15" (1/1) ... [2018-11-14 18:14:15,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:14:15,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:14:16,028 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:16,047 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:14:16,069 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:16,089 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:14:16,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16 WrapperNode [2018-11-14 18:14:16,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:16,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:14:16,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:14:16,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:14:16,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (1/1) ... [2018-11-14 18:14:16,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (1/1) ... [2018-11-14 18:14:16,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (1/1) ... [2018-11-14 18:14:16,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (1/1) ... [2018-11-14 18:14:16,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (1/1) ... [2018-11-14 18:14:16,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (1/1) ... [2018-11-14 18:14:16,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (1/1) ... [2018-11-14 18:14:16,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:14:16,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:14:16,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:14:16,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:14:16,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (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-14 18:14:16,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:14:16,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:14:16,274 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-14 18:14:16,274 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-14 18:14:16,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-14 18:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:14:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-14 18:14:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:14:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:14:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:14:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:14:16,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:14:16,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:14:16,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:14:16,930 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:14:16,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:16 BoogieIcfgContainer [2018-11-14 18:14:16,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:14:16,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:14:16,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:14:16,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:14:16,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:14:15" (1/3) ... [2018-11-14 18:14:16,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bc8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:16, skipping insertion in model container [2018-11-14 18:14:16,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:16" (2/3) ... [2018-11-14 18:14:16,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bc8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:16, skipping insertion in model container [2018-11-14 18:14:16,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:16" (3/3) ... [2018-11-14 18:14:16,940 INFO L112 eAbstractionObserver]: Analyzing ICFG test05_true-unreach-call_true-termination.c [2018-11-14 18:14:16,950 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:14:16,960 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:14:16,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:14:17,007 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:14:17,008 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:14:17,008 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:14:17,008 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:14:17,008 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:14:17,008 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:14:17,009 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:14:17,009 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:14:17,009 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:14:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-14 18:14:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:14:17,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:17,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:17,036 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:17,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1134425000, now seen corresponding path program 1 times [2018-11-14 18:14:17,046 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:17,047 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-14 18:14:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:17,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:17,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-14 18:14:17,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-14 18:14:17,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-14 18:14:17,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #36#return; {28#true} is VALID [2018-11-14 18:14:17,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2018-11-14 18:14:17,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4bv32);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4bv32);call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post3 := #t~mem2;call write~intINTTYPE4(~bvsub32(#t~post3, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {48#(= (_ bv4 32) |main_#t~mem4|)} is VALID [2018-11-14 18:14:17,585 INFO L256 TraceCheckUtils]: 6: Hoare triple {48#(= (_ bv4 32) |main_#t~mem4|)} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {28#true} is VALID [2018-11-14 18:14:17,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {55#(= |f_#in~a| f_~a)} is VALID [2018-11-14 18:14:17,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#(= |f_#in~a| f_~a)} assume !(~a == 4bv32);#res := 0bv32; {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-14 18:14:17,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} assume true; {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-14 18:14:17,591 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} {48#(= (_ bv4 32) |main_#t~mem4|)} #34#return; {29#false} is VALID [2018-11-14 18:14:17,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {29#false} is VALID [2018-11-14 18:14:17,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume #t~mem6 != 1bv32;havoc #t~mem6; {29#false} is VALID [2018-11-14 18:14:17,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-14 18:14:17,597 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-14 18:14:17,597 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:17,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:17,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:14:17,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 18:14:17,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:17,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:14:17,686 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-14 18:14:17,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:14:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:14:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:14:17,700 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2018-11-14 18:14:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:18,428 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-14 18:14:18,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:14:18,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 18:14:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:14:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-14 18:14:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:14:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-14 18:14:18,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-14 18:14:18,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:18,873 INFO L225 Difference]: With dead ends: 36 [2018-11-14 18:14:18,873 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 18:14:18,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:14:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 18:14:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 18:14:18,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:18,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:18,934 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:18,934 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:18,939 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 18:14:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 18:14:18,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:18,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:18,940 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:18,940 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:18,945 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 18:14:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 18:14:18,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:18,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:18,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:18,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:14:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-14 18:14:18,951 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-14 18:14:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:18,951 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-14 18:14:18,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:14:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 18:14:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:14:18,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:18,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:18,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:18,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:18,953 INFO L82 PathProgramCache]: Analyzing trace with hash 131243218, now seen corresponding path program 1 times [2018-11-14 18:14:18,954 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:18,954 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-14 18:14:18,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:19,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:19,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2018-11-14 18:14:19,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {194#true} is VALID [2018-11-14 18:14:19,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2018-11-14 18:14:19,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #36#return; {194#true} is VALID [2018-11-14 18:14:19,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret9 := main(); {194#true} is VALID [2018-11-14 18:14:19,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {194#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4bv32);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4bv32);call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post3 := #t~mem2;call write~intINTTYPE4(~bvsub32(#t~post3, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {194#true} is VALID [2018-11-14 18:14:19,151 INFO L256 TraceCheckUtils]: 6: Hoare triple {194#true} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {194#true} is VALID [2018-11-14 18:14:19,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {194#true} is VALID [2018-11-14 18:14:19,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#true} assume ~a == 4bv32; {194#true} is VALID [2018-11-14 18:14:19,152 INFO L256 TraceCheckUtils]: 9: Hoare triple {194#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {194#true} is VALID [2018-11-14 18:14:19,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#true} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4bv32);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4bv32);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4bv32);havoc #t~mem1.base, #t~mem1.offset;call write~intINTTYPE4(0bv32, ~pq~0.base, ~pq~0.offset, 4bv32); {194#true} is VALID [2018-11-14 18:14:19,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#true} assume true; {194#true} is VALID [2018-11-14 18:14:19,153 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {194#true} {194#true} #32#return; {194#true} is VALID [2018-11-14 18:14:19,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#true} #res := 1bv32; {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:19,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} assume true; {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:14:19,164 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} {194#true} #34#return; {245#(= (_ bv1 32) |main_#t~ret5|)} is VALID [2018-11-14 18:14:19,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {245#(= (_ bv1 32) |main_#t~ret5|)} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {249#(= (_ bv1 32) |main_#t~mem6|)} is VALID [2018-11-14 18:14:19,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {249#(= (_ bv1 32) |main_#t~mem6|)} assume #t~mem6 != 1bv32;havoc #t~mem6; {195#false} is VALID [2018-11-14 18:14:19,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {195#false} assume !false; {195#false} is VALID [2018-11-14 18:14:19,169 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-14 18:14:19,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:19,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:19,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:14:19,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:14:19,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:19,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:14:19,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:19,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:14:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:14:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:14:19,267 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2018-11-14 18:14:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:19,661 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2018-11-14 18:14:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:14:19,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:14:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:14:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-14 18:14:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:14:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-14 18:14:19,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2018-11-14 18:14:19,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:19,739 INFO L225 Difference]: With dead ends: 23 [2018-11-14 18:14:19,739 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 18:14:19,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:14:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 18:14:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 18:14:19,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:19,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:19,752 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:19,752 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:19,755 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-14 18:14:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-14 18:14:19,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:19,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:19,757 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:19,757 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 18:14:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:19,759 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-14 18:14:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-14 18:14:19,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:19,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:19,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:19,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:14:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2018-11-14 18:14:19,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 19 [2018-11-14 18:14:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:19,765 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2018-11-14 18:14:19,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:14:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-14 18:14:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:14:19,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:19,766 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:19,766 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:19,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash -226425686, now seen corresponding path program 1 times [2018-11-14 18:14:19,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:19,768 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:19,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:19,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:20,198 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-14 18:14:20,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 18:14:20,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:20,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:14:20,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:14:20,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:20,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:14:20,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 38 [2018-11-14 18:14:20,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-14 18:14:20,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:20,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-14 18:14:20,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:20,721 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:14:20,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:14:20,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:14:20,819 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2018-11-14 18:14:20,832 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:21,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-14 18:14:21,021 INFO L477 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 16 treesize of output 15 [2018-11-14 18:14:21,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-11-14 18:14:21,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-11-14 18:14:21,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,262 INFO L477 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 28 treesize of output 27 [2018-11-14 18:14:21,265 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,326 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:54, output treesize:42 [2018-11-14 18:14:21,431 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:21,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:14:21,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2018-11-14 18:14:21,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-14 18:14:21,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:27 [2018-11-14 18:14:21,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-14 18:14:21,953 INFO L477 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-14 18:14:21,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:21,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:19 [2018-11-14 18:14:22,006 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:22,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-11-14 18:14:22,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-14 18:14:22,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:22,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:22,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:22,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:3 [2018-11-14 18:14:22,136 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:22,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2018-11-14 18:14:22,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {360#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {360#true} is VALID [2018-11-14 18:14:22,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2018-11-14 18:14:22,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #36#return; {360#true} is VALID [2018-11-14 18:14:22,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {360#true} call #t~ret9 := main(); {360#true} is VALID [2018-11-14 18:14:22,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {360#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4bv32);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4bv32);call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post3 := #t~mem2;call write~intINTTYPE4(~bvsub32(#t~post3, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {380#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (= |main_~#p1~0.base| |main_~#p2~0.base|) (= (_ bv0 32) |main_~#p2~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (= (_ bv0 32) |main_~#p2~0.offset|)))} is VALID [2018-11-14 18:14:22,176 INFO L256 TraceCheckUtils]: 6: Hoare triple {380#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (= |main_~#p1~0.base| |main_~#p2~0.base|) (= (_ bv0 32) |main_~#p2~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (= (_ bv0 32) |main_~#p2~0.offset|)))} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 18:14:22,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} is VALID [2018-11-14 18:14:22,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} assume ~a == 4bv32; {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} is VALID [2018-11-14 18:14:22,180 INFO L256 TraceCheckUtils]: 9: Hoare triple {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 18:14:22,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4bv32);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4bv32);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4bv32);havoc #t~mem1.base, #t~mem1.offset;call write~intINTTYPE4(0bv32, ~pq~0.base, ~pq~0.offset, 4bv32); {398#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)))) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)))} is VALID [2018-11-14 18:14:22,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)))) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)))} assume true; {398#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)))) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)))} is VALID [2018-11-14 18:14:22,189 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {398#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)))) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)))} {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} #32#return; {405#(and (= (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))} is VALID [2018-11-14 18:14:22,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#(and (= (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))} #res := 1bv32; {405#(and (= (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))} is VALID [2018-11-14 18:14:22,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#(and (= (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))} assume true; {405#(and (= (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))} is VALID [2018-11-14 18:14:22,197 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {405#(and (= (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))} {380#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (= |main_~#p1~0.base| |main_~#p2~0.base|) (= (_ bv0 32) |main_~#p2~0.offset|)) (and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (= (_ bv0 32) |main_~#p2~0.offset|)))} #34#return; {415#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|))} is VALID [2018-11-14 18:14:22,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {415#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|))} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {419#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|))} is VALID [2018-11-14 18:14:22,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {419#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) (_ bv0 32)))) (= (_ bv0 32) |main_~#p1~0.offset|))} assume !(#t~mem6 != 1bv32);havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, #t~mem7.offset, 4bv32); {423#(= (_ bv0 32) |main_#t~mem8|)} is VALID [2018-11-14 18:14:22,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {423#(= (_ bv0 32) |main_#t~mem8|)} assume #t~mem8 != 0bv32;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset; {361#false} is VALID [2018-11-14 18:14:22,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {361#false} assume !false; {361#false} is VALID [2018-11-14 18:14:22,208 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-14 18:14:22,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:22,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:22,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 18:14:22,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 18:14:22,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:22,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:14:22,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:22,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:14:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:14:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:14:22,288 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 10 states. [2018-11-14 18:14:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:23,452 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-14 18:14:23,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:14:23,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-14 18:14:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:14:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-11-14 18:14:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:14:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-11-14 18:14:23,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2018-11-14 18:14:23,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:23,624 INFO L225 Difference]: With dead ends: 21 [2018-11-14 18:14:23,624 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:14:23,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:14:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:14:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:14:23,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:23,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:14:23,626 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:14:23,627 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:14:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:23,627 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:14:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:14:23,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:23,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:23,627 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:14:23,628 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:14:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:23,628 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:14:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:14:23,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:23,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:23,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:23,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:14:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:14:23,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-14 18:14:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:23,629 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:14:23,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:14:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:14:23,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:23,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:14:23,987 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:14:23,987 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:14:23,987 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:14:23,988 INFO L421 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (= f_~p2.offset |f_#in~p2.offset|) (= |f_#in~a| f_~a) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|)) [2018-11-14 18:14:23,988 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 17) no Hoare annotation was computed. [2018-11-14 18:14:23,988 INFO L425 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-14 18:14:23,988 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 11 18) no Hoare annotation was computed. [2018-11-14 18:14:23,988 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 11 18) the Hoare annotation is: (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) [2018-11-14 18:14:23,988 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 11 18) no Hoare annotation was computed. [2018-11-14 18:14:23,988 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-14 18:14:23,988 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 4 9) no Hoare annotation was computed. [2018-11-14 18:14:23,988 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 4 9) the Hoare annotation is: (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) [2018-11-14 18:14:23,989 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:14:23,989 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:14:23,989 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:14:23,989 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:14:23,989 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (let ((.cse0 (select |#memory_$Pointer$.base| |main_~#p2~0.base|)) (.cse1 (= (_ bv0 32) |main_~#p1~0.offset|)) (.cse2 (= (_ bv0 32) |main_~#p2~0.offset|))) (or (and (not (= (select .cse0 |main_~#p1~0.offset|) |main_~#a~0.base|)) .cse1 (= |main_~#p1~0.base| |main_~#p2~0.base|) .cse2) (and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= (select .cse0 |main_~#p2~0.offset|) |main_~#a~0.base|)) .cse1 .cse2))) (= (_ bv4 32) |main_#t~mem4|)) [2018-11-14 18:14:23,989 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-14 18:14:23,989 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 20 46) the Hoare annotation is: (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) [2018-11-14 18:14:23,990 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 20 46) no Hoare annotation was computed. [2018-11-14 18:14:23,990 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2018-11-14 18:14:23,990 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 20 46) no Hoare annotation was computed. [2018-11-14 18:14:23,990 INFO L421 ceAbstractionStarter]: At program point L39(lines 20 46) the Hoare annotation is: false [2018-11-14 18:14:23,990 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-14 18:14:23,990 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-14 18:14:23,992 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:14:23,993 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 18:14:23,993 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-14 18:14:23,997 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:14:23,997 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 18:14:23,997 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-14 18:14:23,998 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-14 18:14:23,998 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:14:23,998 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 18:14:24,001 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:14:24,001 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 18:14:24,003 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-14 18:14:24,003 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2018-11-14 18:14:24,003 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:14:24,004 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 18:14:24,004 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 18:14:24,004 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-14 18:14:24,004 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-14 18:14:24,004 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-14 18:14:24,005 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 18:14:24,005 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:14:24,005 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 18:14:24,005 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 18:14:24,005 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:14:24,005 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:14:24,006 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:14:24,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:14:24 BoogieIcfgContainer [2018-11-14 18:14:24,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:14:24,013 INFO L168 Benchmark]: Toolchain (without parser) took 8265.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -391.3 MB). Peak memory consumption was 351.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:24,014 INFO L168 Benchmark]: CDTParser took 0.16 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-14 18:14:24,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.43 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-14 18:14:24,015 INFO L168 Benchmark]: Boogie Preprocessor took 50.81 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-14 18:14:24,020 INFO L168 Benchmark]: RCFGBuilder took 789.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:24,021 INFO L168 Benchmark]: TraceAbstraction took 7079.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 363.7 MB). Peak memory consumption was 363.7 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:24,025 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.16 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 341.43 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 50.81 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 789.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7079.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 363.7 MB). Peak memory consumption was 363.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 20]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. SAFE Result, 6.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 11 SDslu, 143 SDs, 0 SdLazy, 89 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 77 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 7427 SizeOfPredicates, 32 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...