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/loop-acceleration/underapprox_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:19:15,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:19:15,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:19:15,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:19:15,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:19:15,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:19:15,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:19:15,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:19:15,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:19:15,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:19:15,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:19:15,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:19:15,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:19:15,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:19:15,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:19:15,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:19:15,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:19:15,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:19:15,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:19:15,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:19:15,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:19:15,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:19:15,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:19:15,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:19:15,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:19:15,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:19:15,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:19:15,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:19:15,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:19:15,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:19:15,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:19:15,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:19:15,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:19:15,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:19:15,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:19:15,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:19:15,126 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 22:19:15,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:19:15,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:19:15,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:19:15,156 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:19:15,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:19:15,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:19:15,160 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:19:15,160 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:19:15,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:19:15,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:19:15,161 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:19:15,163 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:19:15,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:19:15,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:19:15,163 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:19:15,164 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:19:15,164 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:19:15,164 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:19:15,164 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:19:15,164 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:19:15,165 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:19:15,165 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:19:15,165 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:19:15,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:19:15,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:19:15,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:19:15,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:19:15,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:19:15,169 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:19:15,169 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:19:15,169 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:19:15,169 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:19:15,169 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:19:15,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:19:15,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:19:15,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:19:15,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:19:15,248 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:19:15,249 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-18 22:19:15,317 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad65ffb2f/e37cbbd2184d4e219de39416719544d4/FLAG725d98eb9 [2018-11-18 22:19:15,794 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:19:15,794 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-18 22:19:15,801 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad65ffb2f/e37cbbd2184d4e219de39416719544d4/FLAG725d98eb9 [2018-11-18 22:19:16,278 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad65ffb2f/e37cbbd2184d4e219de39416719544d4 [2018-11-18 22:19:16,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:19:16,290 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:19:16,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:19:16,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:19:16,297 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:19:16,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e91fa4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16, skipping insertion in model container [2018-11-18 22:19:16,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:19:16,341 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:19:16,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:19:16,588 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:19:16,607 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:19:16,626 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:19:16,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16 WrapperNode [2018-11-18 22:19:16,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:19:16,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:19:16,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:19:16,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:19:16,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... [2018-11-18 22:19:16,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:19:16,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:19:16,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:19:16,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:19:16,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:19:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:19:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:19:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:19:16,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:19:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:19:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:19:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:19:16,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:19:16,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:19:17,215 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:19:17,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:17 BoogieIcfgContainer [2018-11-18 22:19:17,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:19:17,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:19:17,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:19:17,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:19:17,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:19:16" (1/3) ... [2018-11-18 22:19:17,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72853a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:17, skipping insertion in model container [2018-11-18 22:19:17,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:16" (2/3) ... [2018-11-18 22:19:17,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72853a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:17, skipping insertion in model container [2018-11-18 22:19:17,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:17" (3/3) ... [2018-11-18 22:19:17,224 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call1_true-termination.i [2018-11-18 22:19:17,233 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:19:17,240 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:19:17,255 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:19:17,288 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:19:17,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:19:17,290 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:19:17,290 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:19:17,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:19:17,291 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:19:17,291 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:19:17,291 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:19:17,291 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:19:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-18 22:19:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 22:19:17,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:19:17,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:19:17,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:19:17,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:19:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-18 22:19:17,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:19:17,332 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 22:19:17,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:19:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:19:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:19:17,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:19:17,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-18 22:19:17,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-18 22:19:17,451 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-18 22:19:17,452 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-18 22:19:17,452 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0bv32;~y~0 := 1bv32; {21#true} is VALID [2018-11-18 22:19:17,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-18 22:19:17,464 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-18 22:19:17,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-18 22:19:17,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0bv32 == ~cond; {22#false} is VALID [2018-11-18 22:19:17,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-18 22:19:17,467 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 22:19:17,467 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:19:17,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:19:17,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:19:17,477 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:19:17,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:19:17,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:19:17,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:19:17,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:19:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:19:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:19:17,536 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-18 22:19:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:17,619 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 22:19:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:19:17,619 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:19:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:19:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:19:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-18 22:19:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:19:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-18 22:19:17,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-18 22:19:17,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:19:17,883 INFO L225 Difference]: With dead ends: 29 [2018-11-18 22:19:17,883 INFO L226 Difference]: Without dead ends: 12 [2018-11-18 22:19:17,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:19:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-18 22:19:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 22:19:18,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:19:18,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-18 22:19:18,004 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-18 22:19:18,004 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-18 22:19:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:18,008 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-18 22:19:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 22:19:18,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:18,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:18,009 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-18 22:19:18,009 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-18 22:19:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:18,012 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-18 22:19:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 22:19:18,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:18,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:18,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:19:18,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:19:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:19:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-18 22:19:18,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-18 22:19:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:19:18,018 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-18 22:19:18,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:19:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 22:19:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:19:18,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:19:18,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:19:18,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:19:18,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:19:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-18 22:19:18,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:19:18,021 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 22:19:18,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:19:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:19:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:19:18,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:19:18,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-18 22:19:18,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-18 22:19:18,156 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #32#return; {133#true} is VALID [2018-11-18 22:19:18,157 INFO L256 TraceCheckUtils]: 3: Hoare triple {133#true} call #t~ret1 := main(); {133#true} is VALID [2018-11-18 22:19:18,158 INFO L273 TraceCheckUtils]: 4: Hoare triple {133#true} ~x~0 := 0bv32;~y~0 := 1bv32; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-18 22:19:18,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume true; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-18 22:19:18,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {134#false} is VALID [2018-11-18 22:19:18,160 INFO L256 TraceCheckUtils]: 7: Hoare triple {134#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {134#false} is VALID [2018-11-18 22:19:18,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {134#false} ~cond := #in~cond; {134#false} is VALID [2018-11-18 22:19:18,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#false} assume 0bv32 == ~cond; {134#false} is VALID [2018-11-18 22:19:18,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-18 22:19:18,162 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 22:19:18,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:19:18,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:19:18,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:19:18,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 22:19:18,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:19:18,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:19:18,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:19:18,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:19:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:19:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:19:18,285 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-18 22:19:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:18,363 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-18 22:19:18,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:19:18,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 22:19:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:19:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:19:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-18 22:19:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:19:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-18 22:19:18,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-18 22:19:18,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:19:18,410 INFO L225 Difference]: With dead ends: 19 [2018-11-18 22:19:18,410 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 22:19:18,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:19:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 22:19:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 22:19:18,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:19:18,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-18 22:19:18,519 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 22:19:18,519 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 22:19:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:18,521 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 22:19:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 22:19:18,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:18,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:18,522 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 22:19:18,522 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 22:19:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:18,524 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 22:19:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 22:19:18,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:18,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:18,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:19:18,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:19:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:19:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-18 22:19:18,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-18 22:19:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:19:18,528 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-18 22:19:18,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:19:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 22:19:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 22:19:18,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:19:18,529 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:19:18,529 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:19:18,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:19:18,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-18 22:19:18,530 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:19:18,530 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 22:19:18,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:19:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:19:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:19:18,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:19:18,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-18 22:19:18,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-18 22:19:18,630 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {247#true} {247#true} #32#return; {247#true} is VALID [2018-11-18 22:19:18,630 INFO L256 TraceCheckUtils]: 3: Hoare triple {247#true} call #t~ret1 := main(); {247#true} is VALID [2018-11-18 22:19:18,638 INFO L273 TraceCheckUtils]: 4: Hoare triple {247#true} ~x~0 := 0bv32;~y~0 := 1bv32; {264#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-18 22:19:18,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#(= main_~x~0 (_ bv0 32))} assume true; {264#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-18 22:19:18,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {264#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:19:18,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:19:18,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {271#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {248#false} is VALID [2018-11-18 22:19:18,645 INFO L256 TraceCheckUtils]: 9: Hoare triple {248#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {248#false} is VALID [2018-11-18 22:19:18,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#false} ~cond := #in~cond; {248#false} is VALID [2018-11-18 22:19:18,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {248#false} assume 0bv32 == ~cond; {248#false} is VALID [2018-11-18 22:19:18,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-18 22:19:18,648 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 22:19:18,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:19:18,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-18 22:19:18,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {248#false} assume 0bv32 == ~cond; {248#false} is VALID [2018-11-18 22:19:18,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#false} ~cond := #in~cond; {248#false} is VALID [2018-11-18 22:19:18,805 INFO L256 TraceCheckUtils]: 9: Hoare triple {248#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {248#false} is VALID [2018-11-18 22:19:18,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {302#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {248#false} is VALID [2018-11-18 22:19:18,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {302#(bvult main_~x~0 (_ bv6 32))} assume true; {302#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-18 22:19:18,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {309#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {302#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-18 22:19:18,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume true; {309#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:18,816 INFO L273 TraceCheckUtils]: 4: Hoare triple {247#true} ~x~0 := 0bv32;~y~0 := 1bv32; {309#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:18,816 INFO L256 TraceCheckUtils]: 3: Hoare triple {247#true} call #t~ret1 := main(); {247#true} is VALID [2018-11-18 22:19:18,817 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {247#true} {247#true} #32#return; {247#true} is VALID [2018-11-18 22:19:18,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-18 22:19:18,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-18 22:19:18,819 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 22:19:18,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:19:18,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 22:19:18,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-18 22:19:18,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:19:18,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:19:18,883 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 22:19:18,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:19:18,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:19:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:19:18,885 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-18 22:19:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:19,362 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-18 22:19:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:19:19,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-18 22:19:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:19:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:19:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-18 22:19:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:19:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-18 22:19:19,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2018-11-18 22:19:19,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:19:19,415 INFO L225 Difference]: With dead ends: 25 [2018-11-18 22:19:19,415 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 22:19:19,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:19:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 22:19:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 22:19:19,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:19:19,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-18 22:19:19,429 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 22:19:19,429 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 22:19:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:19,431 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 22:19:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:19:19,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:19,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:19,433 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 22:19:19,433 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 22:19:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:19,435 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 22:19:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:19:19,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:19,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:19,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:19:19,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:19:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:19:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-18 22:19:19,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2018-11-18 22:19:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:19:19,438 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-18 22:19:19,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:19:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:19:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:19:19,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:19:19,440 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:19:19,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:19:19,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:19:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 2 times [2018-11-18 22:19:19,441 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:19:19,441 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 22:19:19,459 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:19:19,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:19:19,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:19:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:19:19,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:19:19,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-18 22:19:19,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-18 22:19:19,712 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {441#true} {441#true} #32#return; {441#true} is VALID [2018-11-18 22:19:19,712 INFO L256 TraceCheckUtils]: 3: Hoare triple {441#true} call #t~ret1 := main(); {441#true} is VALID [2018-11-18 22:19:19,716 INFO L273 TraceCheckUtils]: 4: Hoare triple {441#true} ~x~0 := 0bv32;~y~0 := 1bv32; {458#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-18 22:19:19,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#(= main_~x~0 (_ bv0 32))} assume true; {458#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-18 22:19:19,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {458#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {465#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:19:19,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {465#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {465#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:19:19,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {465#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {472#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-18 22:19:19,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {472#(= (_ bv2 32) main_~x~0)} assume true; {472#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-18 22:19:19,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {472#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {479#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:19:19,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {479#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {479#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:19:19,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {479#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {486#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-18 22:19:19,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {486#(= (_ bv4 32) main_~x~0)} assume true; {486#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-18 22:19:19,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {486#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~x~0, 6bv32); {442#false} is VALID [2018-11-18 22:19:19,743 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-18 22:19:19,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-18 22:19:19,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume 0bv32 == ~cond; {442#false} is VALID [2018-11-18 22:19:19,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-18 22:19:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:19:19,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:19:20,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-18 22:19:20,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume 0bv32 == ~cond; {442#false} is VALID [2018-11-18 22:19:20,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-18 22:19:20,014 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-18 22:19:20,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {442#false} is VALID [2018-11-18 22:19:20,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {517#(bvult main_~x~0 (_ bv6 32))} assume true; {517#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-18 22:19:20,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {524#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {517#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-18 22:19:20,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {524#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume true; {524#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {531#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {524#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {531#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} assume true; {531#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {531#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,035 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} assume true; {538#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {545#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {538#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {545#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} assume true; {545#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,040 INFO L273 TraceCheckUtils]: 4: Hoare triple {441#true} ~x~0 := 0bv32;~y~0 := 1bv32; {545#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} is VALID [2018-11-18 22:19:20,040 INFO L256 TraceCheckUtils]: 3: Hoare triple {441#true} call #t~ret1 := main(); {441#true} is VALID [2018-11-18 22:19:20,040 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {441#true} {441#true} #32#return; {441#true} is VALID [2018-11-18 22:19:20,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-18 22:19:20,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-18 22:19:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:19:20,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:19:20,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 22:19:20,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-18 22:19:20,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:19:20,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:19:20,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:19:20,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:19:20,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:19:20,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:19:20,154 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-11-18 22:19:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:20,509 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-18 22:19:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:19:20,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-18 22:19:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:19:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:19:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-18 22:19:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:19:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-18 22:19:20,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2018-11-18 22:19:20,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:19:20,569 INFO L225 Difference]: With dead ends: 29 [2018-11-18 22:19:20,569 INFO L226 Difference]: Without dead ends: 24 [2018-11-18 22:19:20,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:19:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-18 22:19:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 22:19:20,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:19:20,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-18 22:19:20,582 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:19:20,582 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:19:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:20,584 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-18 22:19:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:19:20,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:20,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:20,586 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:19:20,586 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:19:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:19:20,588 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-18 22:19:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:19:20,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:19:20,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:19:20,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:19:20,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:19:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:19:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-18 22:19:20,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2018-11-18 22:19:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:19:20,592 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-18 22:19:20,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:19:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:19:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:19:20,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:19:20,594 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:19:20,594 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:19:20,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:19:20,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 3 times [2018-11-18 22:19:20,595 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:19:20,595 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:19:20,613 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 22:19:20,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 22:19:20,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 22:19:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 22:19:20,751 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 22:19:20,779 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 22:19:20,780 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 22:19:20,780 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 22:19:20,780 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-18 22:19:20,780 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-18 22:19:20,780 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:19:20,781 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 22:19:20,781 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 22:19:20,781 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-18 22:19:20,781 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-18 22:19:20,781 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-18 22:19:20,781 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-18 22:19:20,782 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:19:20,782 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-18 22:19:20,782 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-18 22:19:20,782 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-18 22:19:20,782 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-18 22:19:20,782 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:19:20,783 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:19:20,783 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-18 22:19:20,783 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:19:20,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:19:20,783 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:19:20,783 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 22:19:20,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:19:20 BoogieIcfgContainer [2018-11-18 22:19:20,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:19:20,788 INFO L168 Benchmark]: Toolchain (without parser) took 4498.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -522.8 MB). Peak memory consumption was 172.4 MB. Max. memory is 7.1 GB. [2018-11-18 22:19:20,790 INFO L168 Benchmark]: CDTParser took 0.21 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 22:19:20,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.14 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 22:19:20,791 INFO L168 Benchmark]: Boogie Preprocessor took 47.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 22:19:20,792 INFO L168 Benchmark]: RCFGBuilder took 540.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -748.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:19:20,793 INFO L168 Benchmark]: TraceAbstraction took 3569.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 214.9 MB). Peak memory consumption was 214.9 MB. Max. memory is 7.1 GB. [2018-11-18 22:19:20,797 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 336.14 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 47.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 540.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -748.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3569.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 214.9 MB). Peak memory consumption was 214.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. UNSAFE Result, 3.5s OverallTime, 5 OverallIterations, 7 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 0 SDslu, 100 SDs, 0 SdLazy, 52 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=4, 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 2597 SizeOfPredicates, 3 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/44 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...