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/array-examples/sanfoundry_24_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 20:42:07,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 20:42:07,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 20:42:07,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 20:42:07,173 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 20:42:07,174 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 20:42:07,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 20:42:07,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 20:42:07,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 20:42:07,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 20:42:07,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 20:42:07,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 20:42:07,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 20:42:07,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 20:42:07,201 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 20:42:07,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 20:42:07,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 20:42:07,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 20:42:07,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 20:42:07,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 20:42:07,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 20:42:07,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 20:42:07,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 20:42:07,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 20:42:07,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 20:42:07,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 20:42:07,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 20:42:07,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 20:42:07,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 20:42:07,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 20:42:07,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 20:42:07,238 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 20:42:07,239 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 20:42:07,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 20:42:07,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 20:42:07,241 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 20:42:07,241 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 20:42:07,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 20:42:07,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 20:42:07,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 20:42:07,273 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 20:42:07,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 20:42:07,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 20:42:07,274 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 20:42:07,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 20:42:07,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 20:42:07,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 20:42:07,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 20:42:07,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 20:42:07,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 20:42:07,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 20:42:07,276 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 20:42:07,276 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 20:42:07,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 20:42:07,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 20:42:07,277 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 20:42:07,277 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 20:42:07,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 20:42:07,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 20:42:07,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 20:42:07,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 20:42:07,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 20:42:07,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 20:42:07,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 20:42:07,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 20:42:07,279 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 20:42:07,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 20:42:07,280 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 20:42:07,280 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 20:42:07,280 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 20:42:07,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 20:42:07,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 20:42:07,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 20:42:07,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 20:42:07,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 20:42:07,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-18 20:42:07,423 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b073d8b3/0ca54f09afd942a98d7368db3668faae/FLAG0706de619 [2018-11-18 20:42:07,862 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 20:42:07,863 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-18 20:42:07,869 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b073d8b3/0ca54f09afd942a98d7368db3668faae/FLAG0706de619 [2018-11-18 20:42:08,250 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b073d8b3/0ca54f09afd942a98d7368db3668faae [2018-11-18 20:42:08,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 20:42:08,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 20:42:08,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 20:42:08,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 20:42:08,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 20:42:08,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f724456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08, skipping insertion in model container [2018-11-18 20:42:08,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 20:42:08,309 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 20:42:08,567 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:42:08,574 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 20:42:08,604 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:42:08,638 INFO L195 MainTranslator]: Completed translation [2018-11-18 20:42:08,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08 WrapperNode [2018-11-18 20:42:08,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 20:42:08,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 20:42:08,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 20:42:08,640 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 20:42:08,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (1/1) ... [2018-11-18 20:42:08,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 20:42:08,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 20:42:08,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 20:42:08,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 20:42:08,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (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 20:42:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 20:42:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 20:42:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 20:42:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure printEven [2018-11-18 20:42:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure printOdd [2018-11-18 20:42:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 20:42:08,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 20:42:08,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 20:42:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 20:42:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure printEven [2018-11-18 20:42:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure printOdd [2018-11-18 20:42:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 20:42:08,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 20:42:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 20:42:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 20:42:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 20:42:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 20:42:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 20:42:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 20:42:09,473 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 20:42:09,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:42:09 BoogieIcfgContainer [2018-11-18 20:42:09,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 20:42:09,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 20:42:09,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 20:42:09,479 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 20:42:09,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:42:08" (1/3) ... [2018-11-18 20:42:09,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3927eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:42:09, skipping insertion in model container [2018-11-18 20:42:09,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:42:08" (2/3) ... [2018-11-18 20:42:09,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3927eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:42:09, skipping insertion in model container [2018-11-18 20:42:09,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:42:09" (3/3) ... [2018-11-18 20:42:09,483 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-11-18 20:42:09,492 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 20:42:09,501 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 20:42:09,521 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 20:42:09,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 20:42:09,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 20:42:09,558 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 20:42:09,558 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 20:42:09,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 20:42:09,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 20:42:09,559 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 20:42:09,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 20:42:09,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 20:42:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-18 20:42:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 20:42:09,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:42:09,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:42:09,591 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:42:09,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:42:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1715114543, now seen corresponding path program 1 times [2018-11-18 20:42:09,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:42:09,604 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 20:42:09,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:42:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:42:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:42:09,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:42:10,049 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 25 treesize of output 21 [2018-11-18 20:42:10,096 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 21 treesize of output 5 [2018-11-18 20:42:10,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 20:42:10,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 20:42:10,151 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-18 20:42:10,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-18 20:42:10,166 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 20:42:10,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-18 20:42:10,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {41#true} is VALID [2018-11-18 20:42:10,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-18 20:42:10,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #75#return; {41#true} is VALID [2018-11-18 20:42:10,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret7 := main(); {41#true} is VALID [2018-11-18 20:42:10,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {41#true} is VALID [2018-11-18 20:42:10,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-18 20:42:10,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} assume !!~bvslt32(~i~0, ~num~0);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {67#(= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem2|)} is VALID [2018-11-18 20:42:10,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {67#(= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem2|)} assume 0bv32 == ~bvsrem32(#t~mem2, 2bv32);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {71#(= (bvsrem |main_#t~mem3| (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-18 20:42:10,507 INFO L256 TraceCheckUtils]: 9: Hoare triple {71#(= (bvsrem |main_#t~mem3| (_ bv2 32)) (_ bv0 32))} call printEven(#t~mem3); {75#(= (_ bv0 32) (bvsrem |printEven_#in~i| (_ bv2 32)))} is VALID [2018-11-18 20:42:10,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {75#(= (_ bv0 32) (bvsrem |printEven_#in~i| (_ bv2 32)))} ~i := #in~i; {79#(= (bvsrem printEven_~i (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-18 20:42:10,527 INFO L256 TraceCheckUtils]: 11: Hoare triple {79#(= (bvsrem printEven_~i (_ bv2 32)) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {83#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:42:10,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {83#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {87#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:42:10,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {87#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {42#false} is VALID [2018-11-18 20:42:10,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-18 20:42:10,548 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 20:42:10,549 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:42:10,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:42:10,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 20:42:10,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-18 20:42:10,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:42:10,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 20:42:10,707 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 20:42:10,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 20:42:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 20:42:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 20:42:10,719 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 8 states. [2018-11-18 20:42:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:12,446 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-18 20:42:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 20:42:12,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-18 20:42:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:42:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 20:42:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-18 20:42:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 20:42:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-18 20:42:12,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2018-11-18 20:42:12,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:42:12,732 INFO L225 Difference]: With dead ends: 74 [2018-11-18 20:42:12,732 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 20:42:12,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 20:42:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 20:42:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 20:42:12,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:42:12,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-18 20:42:12,812 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 20:42:12,812 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 20:42:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:12,817 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-18 20:42:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 20:42:12,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:42:12,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:42:12,819 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 20:42:12,819 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 20:42:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:12,823 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-18 20:42:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 20:42:12,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:42:12,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:42:12,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:42:12,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:42:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 20:42:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-18 20:42:12,830 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 15 [2018-11-18 20:42:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:42:12,831 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-18 20:42:12,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 20:42:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 20:42:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 20:42:12,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:42:12,833 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 20:42:12,833 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:42:12,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:42:12,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1017076764, now seen corresponding path program 1 times [2018-11-18 20:42:12,834 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:42:12,834 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 20:42:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:42:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:42:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:42:12,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:42:13,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2018-11-18 20:42:13,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {319#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {319#true} is VALID [2018-11-18 20:42:13,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-18 20:42:13,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #75#return; {319#true} is VALID [2018-11-18 20:42:13,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret7 := main(); {319#true} is VALID [2018-11-18 20:42:13,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {319#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {339#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:42:13,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#(= main_~i~0 (_ bv0 32))} assume true; {339#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:42:13,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~num~0); {346#(not (bvslt (_ bv0 32) main_~num~0))} is VALID [2018-11-18 20:42:13,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {346#(not (bvslt (_ bv0 32) main_~num~0))} ~i~0 := 0bv32; {350#(and (not (bvslt (_ bv0 32) main_~num~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 20:42:13,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {350#(and (not (bvslt (_ bv0 32) main_~num~0)) (= main_~i~0 (_ bv0 32)))} assume true; {350#(and (not (bvslt (_ bv0 32) main_~num~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 20:42:13,061 INFO L273 TraceCheckUtils]: 10: Hoare triple {350#(and (not (bvslt (_ bv0 32) main_~num~0)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~num~0);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {320#false} is VALID [2018-11-18 20:42:13,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {320#false} assume 0bv32 != ~bvsrem32(#t~mem5, 2bv32);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {320#false} is VALID [2018-11-18 20:42:13,062 INFO L256 TraceCheckUtils]: 12: Hoare triple {320#false} call printOdd(#t~mem6); {320#false} is VALID [2018-11-18 20:42:13,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {320#false} ~i := #in~i; {320#false} is VALID [2018-11-18 20:42:13,062 INFO L256 TraceCheckUtils]: 14: Hoare triple {320#false} call __VERIFIER_assert((if 0bv32 != ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {320#false} is VALID [2018-11-18 20:42:13,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {320#false} ~cond := #in~cond; {320#false} is VALID [2018-11-18 20:42:13,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {320#false} assume 0bv32 == ~cond; {320#false} is VALID [2018-11-18 20:42:13,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {320#false} assume !false; {320#false} is VALID [2018-11-18 20:42:13,065 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 20:42:13,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:42:13,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:42:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 20:42:13,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 20:42:13,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:42:13,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 20:42:13,098 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 20:42:13,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 20:42:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 20:42:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 20:42:13,099 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-11-18 20:42:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:13,396 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-18 20:42:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 20:42:13,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 20:42:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:42:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 20:42:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2018-11-18 20:42:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 20:42:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2018-11-18 20:42:13,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2018-11-18 20:42:13,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:42:13,552 INFO L225 Difference]: With dead ends: 68 [2018-11-18 20:42:13,553 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 20:42:13,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 20:42:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 20:42:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-11-18 20:42:13,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:42:13,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 39 states. [2018-11-18 20:42:13,584 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 39 states. [2018-11-18 20:42:13,584 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 39 states. [2018-11-18 20:42:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:13,590 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-18 20:42:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 20:42:13,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:42:13,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:42:13,592 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 49 states. [2018-11-18 20:42:13,592 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 49 states. [2018-11-18 20:42:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:13,597 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-18 20:42:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 20:42:13,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:42:13,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:42:13,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:42:13,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:42:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 20:42:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-18 20:42:13,602 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-11-18 20:42:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:42:13,602 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-18 20:42:13,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 20:42:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-18 20:42:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 20:42:13,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:42:13,604 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:42:13,605 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:42:13,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:42:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2025000035, now seen corresponding path program 1 times [2018-11-18 20:42:13,606 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:42:13,606 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 20:42:13,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:42:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:42:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:42:13,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:42:13,949 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 18 treesize of output 14 [2018-11-18 20:42:13,955 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 14 treesize of output 6 [2018-11-18 20:42:13,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 20:42:13,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 20:42:13,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 20:42:13,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-18 20:42:13,969 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 20:42:14,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {621#true} call ULTIMATE.init(); {621#true} is VALID [2018-11-18 20:42:14,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {621#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {621#true} is VALID [2018-11-18 20:42:14,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {621#true} assume true; {621#true} is VALID [2018-11-18 20:42:14,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {621#true} {621#true} #75#return; {621#true} is VALID [2018-11-18 20:42:14,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {621#true} call #t~ret7 := main(); {621#true} is VALID [2018-11-18 20:42:14,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {621#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {641#(and (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 20:42:14,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {641#(and (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume true; {641#(and (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 20:42:14,091 INFO L273 TraceCheckUtils]: 7: Hoare triple {641#(and (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~num~0);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {648#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) |main_#t~mem2|) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-18 20:42:14,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {648#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) |main_#t~mem2|) (= (_ bv0 32) |main_~#array~0.offset|))} assume !(0bv32 == ~bvsrem32(#t~mem2, 2bv32));havoc #t~mem2; {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-18 20:42:14,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-18 20:42:14,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} assume true; {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-18 20:42:14,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} assume !~bvslt32(~i~0, ~num~0); {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-18 20:42:14,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|))} ~i~0 := 0bv32; {665#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 20:42:14,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {665#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume true; {665#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 20:42:14,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {665#(and (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~num~0);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {672#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem5|) (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 20:42:14,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {672#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) |main_#t~mem5|) (not (= (bvsrem (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) |main_~#array~0.offset|) (= main_~i~0 (_ bv0 32)))} assume 0bv32 != ~bvsrem32(#t~mem5, 2bv32);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {676#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-18 20:42:14,104 INFO L256 TraceCheckUtils]: 16: Hoare triple {676#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} call printOdd(#t~mem6); {680#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} is VALID [2018-11-18 20:42:14,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} ~i := #in~i; {684#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} is VALID [2018-11-18 20:42:14,112 INFO L256 TraceCheckUtils]: 18: Hoare triple {684#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} call __VERIFIER_assert((if 0bv32 != ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {688#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:42:14,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {688#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {692#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:42:14,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {692#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {622#false} is VALID [2018-11-18 20:42:14,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {622#false} assume !false; {622#false} is VALID [2018-11-18 20:42:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:42:14,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:42:14,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {622#false} assume !false; {622#false} is VALID [2018-11-18 20:42:14,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {622#false} is VALID [2018-11-18 20:42:14,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {706#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {702#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 20:42:14,340 INFO L256 TraceCheckUtils]: 18: Hoare triple {684#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} call __VERIFIER_assert((if 0bv32 != ~bvsrem32(~i, 2bv32) then 1bv32 else 0bv32)); {706#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 20:42:14,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} ~i := #in~i; {684#(not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32))))} is VALID [2018-11-18 20:42:14,343 INFO L256 TraceCheckUtils]: 16: Hoare triple {676#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} call printOdd(#t~mem6); {680#(not (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32))))} is VALID [2018-11-18 20:42:14,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {719#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) (_ bv2 32)))) (= (bvsrem |main_#t~mem5| (_ bv2 32)) (_ bv0 32)))} assume 0bv32 != ~bvsrem32(#t~mem5, 2bv32);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {676#(not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-18 20:42:14,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#true} assume !!~bvslt32(~i~0, ~num~0);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {719#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) (_ bv2 32)))) (= (bvsrem |main_#t~mem5| (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-18 20:42:14,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#true} assume true; {621#true} is VALID [2018-11-18 20:42:14,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {621#true} ~i~0 := 0bv32; {621#true} is VALID [2018-11-18 20:42:14,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {621#true} assume !~bvslt32(~i~0, ~num~0); {621#true} is VALID [2018-11-18 20:42:14,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {621#true} assume true; {621#true} is VALID [2018-11-18 20:42:14,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {621#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {621#true} is VALID [2018-11-18 20:42:14,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {621#true} assume !(0bv32 == ~bvsrem32(#t~mem2, 2bv32));havoc #t~mem2; {621#true} is VALID [2018-11-18 20:42:14,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {621#true} assume !!~bvslt32(~i~0, ~num~0);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {621#true} is VALID [2018-11-18 20:42:14,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {621#true} assume true; {621#true} is VALID [2018-11-18 20:42:14,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {621#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {621#true} is VALID [2018-11-18 20:42:14,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {621#true} call #t~ret7 := main(); {621#true} is VALID [2018-11-18 20:42:14,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {621#true} {621#true} #75#return; {621#true} is VALID [2018-11-18 20:42:14,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {621#true} assume true; {621#true} is VALID [2018-11-18 20:42:14,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {621#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {621#true} is VALID [2018-11-18 20:42:14,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {621#true} call ULTIMATE.init(); {621#true} is VALID [2018-11-18 20:42:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 20:42:14,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 20:42:14,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2018-11-18 20:42:14,376 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-18 20:42:14,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:42:14,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 20:42:14,512 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 20:42:14,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 20:42:14,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 20:42:14,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-11-18 20:42:14,513 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 15 states. [2018-11-18 20:42:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:17,244 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-11-18 20:42:17,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 20:42:17,245 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-18 20:42:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:42:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 20:42:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2018-11-18 20:42:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 20:42:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2018-11-18 20:42:17,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 93 transitions. [2018-11-18 20:42:17,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:42:17,425 INFO L225 Difference]: With dead ends: 79 [2018-11-18 20:42:17,425 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 20:42:17,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-11-18 20:42:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 20:42:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 20:42:17,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:42:17,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 20:42:17,427 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 20:42:17,427 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 20:42:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:17,428 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 20:42:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 20:42:17,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:42:17,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:42:17,428 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 20:42:17,429 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 20:42:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:42:17,429 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 20:42:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 20:42:17,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:42:17,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:42:17,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:42:17,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:42:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 20:42:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 20:42:17,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-11-18 20:42:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:42:17,430 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 20:42:17,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 20:42:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 20:42:17,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:42:17,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 20:42:17,821 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 20:42:17,821 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 20:42:17,821 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 20:42:17,821 INFO L428 ceAbstractionStarter]: At program point printOddENTRY(lines 7 9) the Hoare annotation is: true [2018-11-18 20:42:17,822 INFO L421 ceAbstractionStarter]: At program point L8(line 8) the Hoare annotation is: (or (not (= (_ bv0 32) (bvsrem printOdd_~i (_ bv2 32)))) (= (_ bv0 32) (bvsrem |printOdd_#in~i| (_ bv2 32)))) [2018-11-18 20:42:17,822 INFO L425 ceAbstractionStarter]: For program point printOddFINAL(lines 7 9) no Hoare annotation was computed. [2018-11-18 20:42:17,822 INFO L425 ceAbstractionStarter]: For program point printOddEXIT(lines 7 9) no Hoare annotation was computed. [2018-11-18 20:42:17,822 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 20:42:17,822 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 20:42:17,822 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 20:42:17,822 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 20:42:17,822 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 30) no Hoare annotation was computed. [2018-11-18 20:42:17,822 INFO L421 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (= (bvsrem |main_#t~mem3| (_ bv2 32)) (_ bv0 32)) [2018-11-18 20:42:17,823 INFO L425 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-18 20:42:17,823 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 20) no Hoare annotation was computed. [2018-11-18 20:42:17,823 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 21) no Hoare annotation was computed. [2018-11-18 20:42:17,823 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 30) no Hoare annotation was computed. [2018-11-18 20:42:17,823 INFO L425 ceAbstractionStarter]: For program point L15-3(lines 15 21) no Hoare annotation was computed. [2018-11-18 20:42:17,823 INFO L428 ceAbstractionStarter]: At program point L15-4(lines 15 21) the Hoare annotation is: true [2018-11-18 20:42:17,823 INFO L425 ceAbstractionStarter]: For program point L15-5(lines 15 21) no Hoare annotation was computed. [2018-11-18 20:42:17,823 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 30) the Hoare annotation is: true [2018-11-18 20:42:17,824 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (not (= (bvsrem |main_#t~mem6| (_ bv2 32)) (_ bv0 32))) (or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~i~0))) (_ bv2 32)))) (= (bvsrem |main_#t~mem5| (_ bv2 32)) (_ bv0 32)))) [2018-11-18 20:42:17,824 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-18 20:42:17,824 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2018-11-18 20:42:17,824 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 28) no Hoare annotation was computed. [2018-11-18 20:42:17,824 INFO L425 ceAbstractionStarter]: For program point L22-3(lines 22 28) no Hoare annotation was computed. [2018-11-18 20:42:17,824 INFO L428 ceAbstractionStarter]: At program point L22-4(lines 22 28) the Hoare annotation is: true [2018-11-18 20:42:17,824 INFO L425 ceAbstractionStarter]: For program point L22-5(lines 22 28) no Hoare annotation was computed. [2018-11-18 20:42:17,825 INFO L425 ceAbstractionStarter]: For program point printEvenEXIT(lines 4 6) no Hoare annotation was computed. [2018-11-18 20:42:17,825 INFO L428 ceAbstractionStarter]: At program point printEvenENTRY(lines 4 6) the Hoare annotation is: true [2018-11-18 20:42:17,825 INFO L425 ceAbstractionStarter]: For program point printEvenFINAL(lines 4 6) no Hoare annotation was computed. [2018-11-18 20:42:17,825 INFO L421 ceAbstractionStarter]: At program point L5(line 5) the Hoare annotation is: (or (not (= (_ bv0 32) (bvsrem |printEven_#in~i| (_ bv2 32)))) (= (bvsrem printEven_~i (_ bv2 32)) (_ bv0 32))) [2018-11-18 20:42:17,825 INFO L425 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2018-11-18 20:42:17,825 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2018-11-18 20:42:17,825 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2018-11-18 20:42:17,825 INFO L425 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2018-11-18 20:42:17,826 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2018-11-18 20:42:17,826 INFO L425 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2018-11-18 20:42:17,827 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 20:42:17,829 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-18 20:42:17,829 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 20:42:17,829 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2018-11-18 20:42:17,829 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: L15-5 has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 20:42:17,830 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2018-11-18 20:42:17,831 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 20:42:17,831 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 20:42:17,831 WARN L170 areAnnotationChecker]: L15-5 has no Hoare annotation [2018-11-18 20:42:17,831 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-18 20:42:17,831 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-18 20:42:17,831 WARN L170 areAnnotationChecker]: L3-3 has no Hoare annotation [2018-11-18 20:42:17,831 WARN L170 areAnnotationChecker]: printOddEXIT has no Hoare annotation [2018-11-18 20:42:17,832 WARN L170 areAnnotationChecker]: printEvenEXIT has no Hoare annotation [2018-11-18 20:42:17,832 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-18 20:42:17,832 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-18 20:42:17,832 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-18 20:42:17,832 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2018-11-18 20:42:17,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 20:42:17,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 20:42:17,833 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 20:42:17,833 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-18 20:42:17,834 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-18 20:42:17,834 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2018-11-18 20:42:17,834 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-18 20:42:17,834 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-18 20:42:17,834 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2018-11-18 20:42:17,835 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2018-11-18 20:42:17,835 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-18 20:42:17,835 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-18 20:42:17,835 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 20:42:17,835 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 20:42:17,835 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 20:42:17,836 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 20:42:17,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:42:17 BoogieIcfgContainer [2018-11-18 20:42:17,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 20:42:17,846 INFO L168 Benchmark]: Toolchain (without parser) took 9584.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -254.0 MB). Peak memory consumption was 474.2 MB. Max. memory is 7.1 GB. [2018-11-18 20:42:17,848 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 20:42:17,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 20:42:17,849 INFO L168 Benchmark]: Boogie Preprocessor took 68.57 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 20:42:17,850 INFO L168 Benchmark]: RCFGBuilder took 763.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-11-18 20:42:17,851 INFO L168 Benchmark]: TraceAbstraction took 8369.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 500.9 MB). Peak memory consumption was 500.9 MB. Max. memory is 7.1 GB. [2018-11-18 20:42:17,855 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 375.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.57 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 763.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8369.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 500.9 MB). Peak memory consumption was 500.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. SAFE Result, 8.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 56 SDslu, 548 SDs, 0 SdLazy, 297 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 34 PreInvPairs, 47 NumberOfFragments, 65 HoareAnnotationTreeSize, 34 FomulaSimplifications, 101 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 37 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 6260 SizeOfPredicates, 20 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...