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-370d6ab [2018-11-14 16:39:44,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:39:44,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:39:44,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:39:44,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:39:44,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:39:44,862 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:39:44,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:39:44,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:39:44,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:39:44,871 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:39:44,871 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:39:44,872 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:39:44,876 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:39:44,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:39:44,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:39:44,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:39:44,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:39:44,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:39:44,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:39:44,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:39:44,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:39:44,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:39:44,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:39:44,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:39:44,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:39:44,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:39:44,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:39:44,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:39:44,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:39:44,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:39:44,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:39:44,914 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:39:44,914 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:39:44,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:39:44,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:39:44,916 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-14 16:39:44,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:39:44,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:39:44,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:39:44,950 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:39:44,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:39:44,951 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:39:44,951 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:39:44,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:39:44,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:39:44,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:39:44,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:39:44,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:39:44,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:39:44,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:39:44,953 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:39:44,953 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:39:44,953 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:39:44,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:39:44,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:39:44,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:39:44,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:39:44,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:39:44,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:39:44,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:39:44,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:39:44,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:39:44,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:39:44,956 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:39:44,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:39:44,957 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:39:44,957 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:39:44,957 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:39:45,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:39:45,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:39:45,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:39:45,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:39:45,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:39:45,035 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-14 16:39:45,104 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d4a4ee7/893065a4f09f403c85f300962598bf79/FLAG4532fe79a [2018-11-14 16:39:45,537 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:39:45,537 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-14 16:39:45,543 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d4a4ee7/893065a4f09f403c85f300962598bf79/FLAG4532fe79a [2018-11-14 16:39:45,558 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d4a4ee7/893065a4f09f403c85f300962598bf79 [2018-11-14 16:39:45,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:39:45,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:39:45,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:45,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:39:45,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:39:45,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b57dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45, skipping insertion in model container [2018-11-14 16:39:45,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:39:45,623 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:39:45,876 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:45,885 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:39:45,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:45,920 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:39:45,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45 WrapperNode [2018-11-14 16:39:45,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:45,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:39:45,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:39:45,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:39:45,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... [2018-11-14 16:39:45,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:39:45,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:39:45,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:39:45,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:39:45,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:39:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:39:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:39:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:39:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:39:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:39:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:39:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:39:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:39:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:39:46,550 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:39:46,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:46 BoogieIcfgContainer [2018-11-14 16:39:46,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:39:46,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:39:46,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:39:46,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:39:46,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:39:45" (1/3) ... [2018-11-14 16:39:46,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1dab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:46, skipping insertion in model container [2018-11-14 16:39:46,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:45" (2/3) ... [2018-11-14 16:39:46,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1dab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:46, skipping insertion in model container [2018-11-14 16:39:46,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:46" (3/3) ... [2018-11-14 16:39:46,559 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call1_true-termination.i [2018-11-14 16:39:46,568 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:39:46,575 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:39:46,594 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:39:46,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:39:46,626 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:39:46,626 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:39:46,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:39:46,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:39:46,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:39:46,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:39:46,627 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:39:46,627 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:39:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 16:39:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 16:39:46,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:46,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:46,656 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:46,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 16:39:46,667 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:46,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:46,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:46,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 16:39:46,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 16:39:46,804 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 16:39:46,804 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-14 16:39:46,804 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0bv32;~y~0 := 1bv32; {21#true} is VALID [2018-11-14 16:39:46,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 16:39:46,806 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~y~0 != 64bv32 then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-14 16:39:46,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 16:39:46,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0bv32; {22#false} is VALID [2018-11-14 16:39:46,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 16:39:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:46,810 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:39:46,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:46,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:39:46,818 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:39:46,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:46,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:39:46,881 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-14 16:39:46,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:39:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:39:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:46,892 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 16:39:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:46,969 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 16:39:46,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:39:46,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:39:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 16:39:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 16:39:46,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 16:39:47,245 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-14 16:39:47,260 INFO L225 Difference]: With dead ends: 29 [2018-11-14 16:39:47,260 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 16:39:47,267 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-14 16:39:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 16:39:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 16:39:47,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:47,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 16:39:47,330 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 16:39:47,330 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 16:39:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:47,333 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 16:39:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:39:47,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:47,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:47,335 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 16:39:47,335 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 16:39:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:47,338 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 16:39:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:39:47,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:47,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:47,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:47,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 16:39:47,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 16:39:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:47,344 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 16:39:47,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:39:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:39:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:39:47,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:47,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:47,346 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:47,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:47,346 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 16:39:47,347 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:47,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:47,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:47,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:47,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-14 16:39:47,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-14 16:39:47,466 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #32#return; {133#true} is VALID [2018-11-14 16:39:47,466 INFO L256 TraceCheckUtils]: 3: Hoare triple {133#true} call #t~ret1 := main(); {133#true} is VALID [2018-11-14 16:39:47,467 INFO L273 TraceCheckUtils]: 4: Hoare triple {133#true} ~x~0 := 0bv32;~y~0 := 1bv32; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:47,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume true; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:47,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {134#false} is VALID [2018-11-14 16:39:47,470 INFO L256 TraceCheckUtils]: 7: Hoare triple {134#false} call __VERIFIER_assert((if ~y~0 != 64bv32 then 1bv32 else 0bv32)); {134#false} is VALID [2018-11-14 16:39:47,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {134#false} ~cond := #in~cond; {134#false} is VALID [2018-11-14 16:39:47,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#false} assume ~cond == 0bv32; {134#false} is VALID [2018-11-14 16:39:47,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-14 16:39:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:47,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:47,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:47,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:39:47,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:39:47,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:47,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:39:47,563 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-14 16:39:47,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:39:47,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:39:47,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:47,564 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 16:39:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:47,655 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 16:39:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:39:47,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:39:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 16:39:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 16:39:47,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 16:39:47,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:47,699 INFO L225 Difference]: With dead ends: 19 [2018-11-14 16:39:47,699 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 16:39:47,701 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-14 16:39:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 16:39:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 16:39:47,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:47,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 16:39:47,805 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:39:47,805 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:39:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:47,807 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 16:39:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:39:47,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:47,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:47,809 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:39:47,809 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:39:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:47,811 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 16:39:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:39:47,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:47,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:47,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:47,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:39:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 16:39:47,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 16:39:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:47,814 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 16:39:47,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:39:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:39:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:39:47,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:47,816 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:47,816 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:47,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:47,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 16:39:47,817 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:47,817 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:47,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:47,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:47,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-14 16:39:47,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-14 16:39:47,931 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {247#true} {247#true} #32#return; {247#true} is VALID [2018-11-14 16:39:47,931 INFO L256 TraceCheckUtils]: 3: Hoare triple {247#true} call #t~ret1 := main(); {247#true} is VALID [2018-11-14 16:39:47,932 INFO L273 TraceCheckUtils]: 4: Hoare triple {247#true} ~x~0 := 0bv32;~y~0 := 1bv32; {264#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:47,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#(= main_~x~0 (_ bv0 32))} assume true; {264#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:47,934 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-14 16:39:47,934 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-14 16:39:47,935 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-14 16:39:47,935 INFO L256 TraceCheckUtils]: 9: Hoare triple {248#false} call __VERIFIER_assert((if ~y~0 != 64bv32 then 1bv32 else 0bv32)); {248#false} is VALID [2018-11-14 16:39:47,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#false} ~cond := #in~cond; {248#false} is VALID [2018-11-14 16:39:47,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {248#false} assume ~cond == 0bv32; {248#false} is VALID [2018-11-14 16:39:47,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-14 16:39:47,939 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-14 16:39:47,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:48,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-14 16:39:48,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {248#false} assume ~cond == 0bv32; {248#false} is VALID [2018-11-14 16:39:48,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#false} ~cond := #in~cond; {248#false} is VALID [2018-11-14 16:39:48,081 INFO L256 TraceCheckUtils]: 9: Hoare triple {248#false} call __VERIFIER_assert((if ~y~0 != 64bv32 then 1bv32 else 0bv32)); {248#false} is VALID [2018-11-14 16:39:48,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {302#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {248#false} is VALID [2018-11-14 16:39:48,089 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-14 16:39:48,091 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-14 16:39:48,094 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-14 16:39:48,095 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-14 16:39:48,095 INFO L256 TraceCheckUtils]: 3: Hoare triple {247#true} call #t~ret1 := main(); {247#true} is VALID [2018-11-14 16:39:48,095 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {247#true} {247#true} #32#return; {247#true} is VALID [2018-11-14 16:39:48,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-14 16:39:48,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-14 16:39:48,099 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-14 16:39:48,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:48,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:39:48,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 16:39:48,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:48,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:39:48,158 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-14 16:39:48,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:39:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:39:48,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:39:48,159 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-14 16:39:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:48,609 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 16:39:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:39:48,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 16:39:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-14 16:39:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-14 16:39:48,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2018-11-14 16:39:48,659 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-14 16:39:48,660 INFO L225 Difference]: With dead ends: 25 [2018-11-14 16:39:48,660 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 16:39:48,661 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-14 16:39:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 16:39:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 16:39:48,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:48,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 16:39:48,673 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:39:48,673 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:39:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:48,675 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 16:39:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 16:39:48,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:48,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:48,676 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:39:48,677 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:39:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:48,679 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 16:39:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 16:39:48,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:48,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:48,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:48,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:39:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 16:39:48,682 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2018-11-14 16:39:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:48,682 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 16:39:48,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:39:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 16:39:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:39:48,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:48,683 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:48,684 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:48,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 2 times [2018-11-14 16:39:48,685 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:48,685 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-14 16:39:48,702 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:48,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:39:48,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:48,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:48,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-14 16:39:48,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-14 16:39:48,939 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {441#true} {441#true} #32#return; {441#true} is VALID [2018-11-14 16:39:48,939 INFO L256 TraceCheckUtils]: 3: Hoare triple {441#true} call #t~ret1 := main(); {441#true} is VALID [2018-11-14 16:39:48,944 INFO L273 TraceCheckUtils]: 4: Hoare triple {441#true} ~x~0 := 0bv32;~y~0 := 1bv32; {458#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:48,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#(= main_~x~0 (_ bv0 32))} assume true; {458#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:48,950 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-14 16:39:48,951 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-14 16:39:48,968 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-14 16:39:48,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {472#(= (_ bv2 32) main_~x~0)} assume true; {472#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:48,969 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-14 16:39:48,970 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-14 16:39:48,971 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-14 16:39:48,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {486#(= (_ bv4 32) main_~x~0)} assume true; {486#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:48,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {486#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~x~0, 6bv32); {442#false} is VALID [2018-11-14 16:39:48,973 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if ~y~0 != 64bv32 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-14 16:39:48,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-14 16:39:48,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume ~cond == 0bv32; {442#false} is VALID [2018-11-14 16:39:48,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-14 16:39:48,976 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-14 16:39:48,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:49,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-14 16:39:49,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume ~cond == 0bv32; {442#false} is VALID [2018-11-14 16:39:49,226 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-14 16:39:49,226 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if ~y~0 != 64bv32 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-14 16:39:49,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {442#false} is VALID [2018-11-14 16:39:49,228 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-14 16:39:49,228 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-14 16:39:49,229 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-14 16:39:49,232 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-14 16:39:49,233 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-14 16:39:49,237 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-14 16:39:49,237 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-14 16:39:49,243 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-14 16:39:49,244 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-14 16:39:49,244 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-14 16:39:49,244 INFO L256 TraceCheckUtils]: 3: Hoare triple {441#true} call #t~ret1 := main(); {441#true} is VALID [2018-11-14 16:39:49,245 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {441#true} {441#true} #32#return; {441#true} is VALID [2018-11-14 16:39:49,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-14 16:39:49,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-14 16:39:49,247 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-14 16:39:49,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:39:49,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 16:39:49,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:49,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:39:49,378 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-14 16:39:49,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:39:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:39:49,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:39:49,379 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-11-14 16:39:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:49,714 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-14 16:39:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:39:49,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 16:39:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-14 16:39:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-14 16:39:49,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2018-11-14 16:39:49,769 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-14 16:39:49,770 INFO L225 Difference]: With dead ends: 29 [2018-11-14 16:39:49,770 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:39:49,771 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:39:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:39:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:39:49,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:49,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:49,784 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:49,784 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:49,786 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 16:39:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 16:39:49,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:49,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:49,788 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:49,788 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:49,790 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 16:39:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 16:39:49,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:49,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:49,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:49,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:39:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 16:39:49,793 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2018-11-14 16:39:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:49,794 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 16:39:49,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:39:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 16:39:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:39:49,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:49,795 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:49,795 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:49,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 3 times [2018-11-14 16:39:49,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:49,796 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-14 16:39:49,815 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:39:49,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 16:39:49,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-14 16:39:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 16:39:49,951 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 16:39:49,995 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:39:49,995 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 16:39:49,995 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 16:39:49,996 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 16:39:49,996 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 16:39:49,996 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:39:49,996 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 16:39:49,996 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 16:39:49,997 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-14 16:39:49,997 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-14 16:39:49,997 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 16:39:49,997 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 16:39:49,997 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:39:49,997 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:39:49,997 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:39:50,003 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-14 16:39:50,003 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-14 16:39:50,003 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:39:50,003 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:39:50,003 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 16:39:50,004 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:39:50,004 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:39:50,004 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:39:50,004 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-14 16:39:50,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:39:50 BoogieIcfgContainer [2018-11-14 16:39:50,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:39:50,012 INFO L168 Benchmark]: Toolchain (without parser) took 4438.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -573.8 MB). Peak memory consumption was 184.8 MB. Max. memory is 7.1 GB. [2018-11-14 16:39:50,019 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:39:50,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:39:50,021 INFO L168 Benchmark]: Boogie Preprocessor took 38.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:39:50,021 INFO L168 Benchmark]: RCFGBuilder took 590.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 16:39:50,022 INFO L168 Benchmark]: TraceAbstraction took 3458.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.2 MB). Peak memory consumption was 222.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:39:50,034 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.24 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 343.90 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 38.43 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 590.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3458.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.2 MB). Peak memory consumption was 222.2 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.3s 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.3s 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, 0.9s 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...