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.epf -i ../../../trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:50:39,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:50:39,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:50:39,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:50:39,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:50:39,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:50:39,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:50:39,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:50:39,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:50:39,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:50:39,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:50:39,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:50:39,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:50:39,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:50:39,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:50:39,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:50:39,170 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:50:39,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:50:39,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:50:39,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:50:39,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:50:39,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:50:39,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:50:39,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:50:39,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:50:39,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:50:39,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:50:39,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:50:39,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:50:39,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:50:39,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:50:39,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:50:39,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:50:39,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:50:39,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:50:39,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:50:39,198 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-18 21:50:39,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:50:39,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:50:39,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:50:39,215 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:50:39,216 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:50:39,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:50:39,216 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:50:39,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:50:39,216 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:50:39,217 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:50:39,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:50:39,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:50:39,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:50:39,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:50:39,218 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:50:39,218 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:50:39,218 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:50:39,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:50:39,218 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:50:39,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:50:39,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:50:39,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:50:39,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:50:39,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:50:39,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:50:39,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:50:39,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:50:39,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:50:39,221 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:50:39,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:50:39,222 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:50:39,222 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:50:39,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:50:39,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:50:39,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:50:39,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:50:39,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:50:39,290 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:50:39,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c [2018-11-18 21:50:39,360 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3760fe9c2/aaf5341745bd4670a55068023d8d2db0/FLAG0ae4125d4 [2018-11-18 21:50:39,795 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:50:39,796 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c [2018-11-18 21:50:39,801 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3760fe9c2/aaf5341745bd4670a55068023d8d2db0/FLAG0ae4125d4 [2018-11-18 21:50:40,162 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3760fe9c2/aaf5341745bd4670a55068023d8d2db0 [2018-11-18 21:50:40,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:50:40,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:50:40,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:40,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:50:40,179 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:50:40,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31129c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40, skipping insertion in model container [2018-11-18 21:50:40,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:50:40,229 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:50:40,467 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:40,489 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:50:40,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:40,540 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:50:40,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40 WrapperNode [2018-11-18 21:50:40,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:40,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:50:40,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:50:40,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:50:40,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... [2018-11-18 21:50:40,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:50:40,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:50:40,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:50:40,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:50:40,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:50:40,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:50:40,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:50:40,713 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-18 21:50:40,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:50:40,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:50:40,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:50:40,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-18 21:50:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-18 21:50:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:50:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:50:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:50:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:50:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:50:40,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:50:40,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:50:40,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:50:41,292 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:50:41,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:41 BoogieIcfgContainer [2018-11-18 21:50:41,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:50:41,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:50:41,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:50:41,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:50:41,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:50:40" (1/3) ... [2018-11-18 21:50:41,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a189164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:41, skipping insertion in model container [2018-11-18 21:50:41,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:40" (2/3) ... [2018-11-18 21:50:41,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a189164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:41, skipping insertion in model container [2018-11-18 21:50:41,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:41" (3/3) ... [2018-11-18 21:50:41,302 INFO L112 eAbstractionObserver]: Analyzing ICFG test11_true-unreach-call_true-termination.c [2018-11-18 21:50:41,311 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:50:41,318 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:50:41,332 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:50:41,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:50:41,364 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:50:41,364 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:50:41,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:50:41,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:50:41,365 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:50:41,365 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:50:41,365 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:50:41,366 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:50:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 21:50:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 21:50:41,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:41,393 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:41,395 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -722462527, now seen corresponding path program 1 times [2018-11-18 21:50:41,407 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:41,408 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-18 21:50:41,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:41,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:42,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-18 21:50:42,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {26#true} is VALID [2018-11-18 21:50:42,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-18 21:50:42,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #43#return; {26#true} is VALID [2018-11-18 21:50:42,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret11 := main(); {26#true} is VALID [2018-11-18 21:50:42,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#c~0.base, ~#c~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {46#(not (= main_~pc~0.base (_ bv0 32)))} is VALID [2018-11-18 21:50:42,084 INFO L256 TraceCheckUtils]: 6: Hoare triple {46#(not (= main_~pc~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {26#true} is VALID [2018-11-18 21:50:42,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#true} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {26#true} is VALID [2018-11-18 21:50:42,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {26#true} is VALID [2018-11-18 21:50:42,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-18 21:50:42,087 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {26#true} {46#(not (= main_~pc~0.base (_ bv0 32)))} #47#return; {46#(not (= main_~pc~0.base (_ bv0 32)))} is VALID [2018-11-18 21:50:42,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#(not (= main_~pc~0.base (_ bv0 32)))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {65#(not |main_#t~short9|)} is VALID [2018-11-18 21:50:42,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {65#(not |main_#t~short9|)} assume #t~short9; {27#false} is VALID [2018-11-18 21:50:42,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {27#false} assume #t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~short8;havoc #t~mem6; {27#false} is VALID [2018-11-18 21:50:42,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-18 21:50:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:42,109 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:42,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:42,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:50:42,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 21:50:42,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:42,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:50:42,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:42,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:50:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:50:42,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:50:42,194 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2018-11-18 21:50:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:42,564 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-18 21:50:42,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:50:42,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 21:50:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:50:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-18 21:50:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:50:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-18 21:50:42,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2018-11-18 21:50:42,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:42,696 INFO L225 Difference]: With dead ends: 31 [2018-11-18 21:50:42,697 INFO L226 Difference]: Without dead ends: 19 [2018-11-18 21:50:42,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:50:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-18 21:50:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 21:50:42,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:42,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-18 21:50:42,741 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-18 21:50:42,742 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-18 21:50:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:42,746 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-18 21:50:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-18 21:50:42,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:42,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:42,747 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-18 21:50:42,747 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-18 21:50:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:42,751 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-18 21:50:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-18 21:50:42,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:42,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:42,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:42,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 21:50:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-18 21:50:42,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-18 21:50:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:42,758 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 21:50:42,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:50:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-18 21:50:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 21:50:42,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:42,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:42,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:42,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1499811687, now seen corresponding path program 1 times [2018-11-18 21:50:42,761 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:42,761 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-18 21:50:42,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:42,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:43,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {179#true} is VALID [2018-11-18 21:50:43,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {179#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:43,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} assume true; {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:43,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {187#(= (_ bv0 32) |~#a~0.offset|)} {179#true} #43#return; {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:43,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} call #t~ret11 := main(); {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:43,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#c~0.base, ~#c~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:43,585 INFO L256 TraceCheckUtils]: 6: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} call #t~ret5.base, #t~ret5.offset := get_dummy(); {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:43,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {206#(and (= |get_dummy_#t~ite1.offset| |~#a~0.offset|) (= |~#a~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:43,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#(and (= |get_dummy_#t~ite1.offset| |~#a~0.offset|) (= |~#a~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#a~0.offset|))} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:43,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} assume true; {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:43,599 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} {187#(= (_ bv0 32) |~#a~0.offset|)} #47#return; {217#(= |main_#t~ret5.offset| (_ bv0 32))} is VALID [2018-11-18 21:50:43,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#(= |main_#t~ret5.offset| (_ bv0 32))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-18 21:50:43,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-18 21:50:43,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume #t~short8;call #t~mem6 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short8 := #t~mem6 != #t~mem7; {228#(not |main_#t~short8|)} is VALID [2018-11-18 21:50:43,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {228#(not |main_#t~short8|)} #t~short9 := #t~short8; {232#(not |main_#t~short9|)} is VALID [2018-11-18 21:50:43,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {232#(not |main_#t~short9|)} assume #t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~short8;havoc #t~mem6; {180#false} is VALID [2018-11-18 21:50:43,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {180#false} assume !false; {180#false} is VALID [2018-11-18 21:50:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:43,630 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:43,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:43,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 21:50:43,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:43,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:43,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 21:50:43,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:43,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 21:50:43,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 21:50:43,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 21:50:43,688 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 9 states. [2018-11-18 21:50:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:44,645 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 21:50:44,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 21:50:44,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-18 21:50:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-18 21:50:44,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2018-11-18 21:50:44,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:44,716 INFO L225 Difference]: With dead ends: 34 [2018-11-18 21:50:44,717 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 21:50:44,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-18 21:50:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 21:50:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-18 21:50:44,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:44,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2018-11-18 21:50:44,741 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2018-11-18 21:50:44,741 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2018-11-18 21:50:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:44,744 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-18 21:50:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-18 21:50:44,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:44,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:44,746 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2018-11-18 21:50:44,746 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2018-11-18 21:50:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:44,749 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-18 21:50:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-18 21:50:44,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:44,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:44,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:44,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 21:50:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 21:50:44,754 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-18 21:50:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:44,754 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 21:50:44,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 21:50:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 21:50:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 21:50:44,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:44,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:44,756 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:44,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1106784677, now seen corresponding path program 1 times [2018-11-18 21:50:44,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:44,757 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-18 21:50:44,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:44,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:44,985 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 59 treesize of output 36 [2018-11-18 21:50:45,039 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-18 21:50:45,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:45,201 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-11-18 21:50:45,224 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 31 treesize of output 30 [2018-11-18 21:50:45,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:45,503 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 21:50:45,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 21:50:45,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 57 [2018-11-18 21:50:46,041 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 37 [2018-11-18 21:50:46,050 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 21:50:46,459 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 21:50:46,463 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 21:50:46,707 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 27 treesize of output 26 [2018-11-18 21:50:46,709 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:46,959 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 21:50:47,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2018-11-18 21:50:47,515 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 34 treesize of output 33 [2018-11-18 21:50:47,524 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:47,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 44 [2018-11-18 21:50:47,951 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-11-18 21:50:48,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 44 [2018-11-18 21:50:48,443 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-11-18 21:50:48,805 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-18 21:50:49,252 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 25 treesize of output 37 [2018-11-18 21:50:49,267 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 26 treesize of output 25 [2018-11-18 21:50:49,303 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:49,495 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-11-18 21:50:49,499 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-18 21:50:49,559 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 21:50:49,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-18 21:50:49,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 21:50:50,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:50,079 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:63, output treesize:3 [2018-11-18 21:50:50,137 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:50:50,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-18 21:50:50,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {391#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:50,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} assume true; {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:50,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#(= (_ bv0 32) |~#b~0.offset|)} {391#true} #43#return; {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:50,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} call #t~ret11 := main(); {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:50,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#c~0.base, ~#c~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:50,280 INFO L256 TraceCheckUtils]: 6: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} call #t~ret5.base, #t~ret5.offset := get_dummy(); {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:50,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} assume !(0bv8 != #t~nondet0);#t~ite1.base, #t~ite1.offset := ~#b~0.base, ~#b~0.offset; {418#(and (= |~#b~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#b~0.offset|) (= |get_dummy_#t~ite1.offset| |~#b~0.offset|))} is VALID [2018-11-18 21:50:50,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {418#(and (= |~#b~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#b~0.offset|) (= |get_dummy_#t~ite1.offset| |~#b~0.offset|))} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} is VALID [2018-11-18 21:50:50,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} assume true; {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} is VALID [2018-11-18 21:50:50,287 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} {399#(= (_ bv0 32) |~#b~0.offset|)} #47#return; {429#(= |main_#t~ret5.offset| (_ bv0 32))} is VALID [2018-11-18 21:50:50,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {429#(= |main_#t~ret5.offset| (_ bv0 32))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-18 21:50:50,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-18 21:50:50,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume #t~short8;call #t~mem6 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short8 := #t~mem6 != #t~mem7; {440#(not |main_#t~short8|)} is VALID [2018-11-18 21:50:50,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {440#(not |main_#t~short8|)} #t~short9 := #t~short8; {444#(not |main_#t~short9|)} is VALID [2018-11-18 21:50:50,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {444#(not |main_#t~short9|)} assume #t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~short8;havoc #t~mem6; {392#false} is VALID [2018-11-18 21:50:50,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-18 21:50:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:50,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 21:50:50,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:50,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:50,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 21:50:50,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:50,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 21:50:50,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 21:50:50,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 21:50:50,369 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 9 states. [2018-11-18 21:50:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:51,360 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-18 21:50:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 21:50:51,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-18 21:50:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-18 21:50:51,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 35 transitions. [2018-11-18 21:50:51,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:51,435 INFO L225 Difference]: With dead ends: 36 [2018-11-18 21:50:51,435 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 21:50:51,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-18 21:50:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 21:50:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-11-18 21:50:51,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:51,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 19 states. [2018-11-18 21:50:51,472 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 19 states. [2018-11-18 21:50:51,472 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 19 states. [2018-11-18 21:50:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:51,475 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-18 21:50:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-18 21:50:51,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:51,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:51,476 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 34 states. [2018-11-18 21:50:51,476 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 34 states. [2018-11-18 21:50:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:51,479 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-18 21:50:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-18 21:50:51,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:51,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:51,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:51,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 21:50:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-18 21:50:51,482 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-11-18 21:50:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:51,482 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-18 21:50:51,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 21:50:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-18 21:50:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 21:50:51,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:51,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:51,484 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:51,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash -750476091, now seen corresponding path program 1 times [2018-11-18 21:50:51,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:51,485 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:50:51,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:51,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:51,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {601#true} is VALID [2018-11-18 21:50:51,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {601#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {601#true} is VALID [2018-11-18 21:50:51,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-18 21:50:51,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #43#return; {601#true} is VALID [2018-11-18 21:50:51,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret11 := main(); {601#true} is VALID [2018-11-18 21:50:51,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {601#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#c~0.base, ~#c~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-18 21:50:51,657 INFO L256 TraceCheckUtils]: 6: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {601#true} is VALID [2018-11-18 21:50:51,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {601#true} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {601#true} is VALID [2018-11-18 21:50:51,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {601#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {601#true} is VALID [2018-11-18 21:50:51,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-18 21:50:51,658 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {601#true} {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} #47#return; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-18 21:50:51,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-18 21:50:51,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-18 21:50:51,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} assume #t~short8;call #t~mem6 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short8 := #t~mem6 != #t~mem7; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-18 21:50:51,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} #t~short9 := #t~short8; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-18 21:50:51,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~short8;havoc #t~mem6;call write~intINTTYPE4(60bv32, ~pc~0.base, ~pc~0.offset, 4bv32);call #t~mem10 := read~intINTTYPE4(~#c~0.base, ~#c~0.offset, 4bv32); {652#(= (bvadd |main_#t~mem10| (_ bv4294967236 32)) (_ bv0 32))} is VALID [2018-11-18 21:50:51,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {652#(= (bvadd |main_#t~mem10| (_ bv4294967236 32)) (_ bv0 32))} assume 60bv32 != #t~mem10;havoc #t~mem10; {602#false} is VALID [2018-11-18 21:50:51,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {602#false} assume !false; {602#false} is VALID [2018-11-18 21:50:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:51,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:51,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:51,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:50:51,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 21:50:51,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:51,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:50:51,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:51,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:50:51,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:50:51,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:50:51,719 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2018-11-18 21:50:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:52,028 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-18 21:50:52,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:50:52,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 21:50:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:50:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-18 21:50:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:50:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-18 21:50:52,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2018-11-18 21:50:52,097 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-18 21:50:52,098 INFO L225 Difference]: With dead ends: 19 [2018-11-18 21:50:52,098 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 21:50:52,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:50:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 21:50:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 21:50:52,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:52,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:52,099 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:52,100 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:52,100 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:52,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:52,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:52,100 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:52,100 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:52,101 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:52,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:52,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:52,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:52,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 21:50:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 21:50:52,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-18 21:50:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:52,102 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 21:50:52,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:50:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:52,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:52,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 21:50:52,389 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:52,389 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:52,390 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:52,390 INFO L425 ceAbstractionStarter]: For program point get_dummyFINAL(lines 7 10) no Hoare annotation was computed. [2018-11-18 21:50:52,390 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-18 21:50:52,390 INFO L428 ceAbstractionStarter]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2018-11-18 21:50:52,390 INFO L425 ceAbstractionStarter]: For program point get_dummyEXIT(lines 7 10) no Hoare annotation was computed. [2018-11-18 21:50:52,390 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:52,390 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv0 32) |~#b~0.offset|) (= (_ bv0 32) |~#a~0.offset|)) [2018-11-18 21:50:52,390 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:52,390 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:52,391 INFO L421 ceAbstractionStarter]: At program point L25(lines 12 32) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-18 21:50:52,391 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2018-11-18 21:50:52,391 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-18 21:50:52,391 INFO L421 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (and (not (= main_~pc~0.base (_ bv0 32))) (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset)) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-18 21:50:52,391 INFO L425 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2018-11-18 21:50:52,391 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-18 21:50:52,391 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2018-11-18 21:50:52,391 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 32) the Hoare annotation is: true [2018-11-18 21:50:52,391 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-18 21:50:52,391 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-18 21:50:52,392 INFO L425 ceAbstractionStarter]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2018-11-18 21:50:52,392 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2018-11-18 21:50:52,393 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:52,393 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:52,393 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-18 21:50:52,395 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:52,396 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 21:50:52,396 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 21:50:52,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:50:52 BoogieIcfgContainer [2018-11-18 21:50:52,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 21:50:52,406 INFO L168 Benchmark]: Toolchain (without parser) took 12233.40 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -900.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:50:52,408 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-18 21:50:52,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:52,409 INFO L168 Benchmark]: Boogie Preprocessor took 42.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:50:52,410 INFO L168 Benchmark]: RCFGBuilder took 708.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:52,411 INFO L168 Benchmark]: TraceAbstraction took 11111.23 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -135.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:50:52,415 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 365.61 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 42.79 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 708.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11111.23 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -135.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: 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: 12]: Loop Invariant Derived loop invariant: !(a == 0bv32) || !(0bv32 == b) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 11.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 62 SDslu, 228 SDs, 0 SdLazy, 157 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, 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, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 43 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 4033 SizeOfPredicates, 32 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...