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-lit/gsv2008_true-unreach-call.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:31:17,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:31:17,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:31:17,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:31:17,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:31:17,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:31:17,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:31:17,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:31:17,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:31:17,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:31:17,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:31:17,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:31:17,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:31:17,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:31:17,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:31:17,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:31:17,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:31:17,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:31:17,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:31:17,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:31:17,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:31:17,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:31:17,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:31:17,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:31:17,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:31:17,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:31:17,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:31:17,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:31:17,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:31:17,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:31:17,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:31:17,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:31:17,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:31:17,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:31:17,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:31:17,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:31:17,059 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:31:17,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:31:17,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:31:17,076 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:31:17,076 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:31:17,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:31:17,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:31:17,077 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:31:17,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:31:17,078 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:31:17,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:31:17,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:31:17,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:31:17,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:31:17,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:31:17,079 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:31:17,079 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:31:17,079 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:31:17,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:31:17,080 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:31:17,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:31:17,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:31:17,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:31:17,080 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:31:17,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:31:17,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:31:17,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:31:17,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:31:17,081 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:31:17,082 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:31:17,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:31:17,082 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:31:17,082 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:31:17,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:31:17,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:31:17,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:31:17,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:31:17,159 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:31:17,159 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:31:17,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+cfa-reducer.c [2018-11-18 22:31:17,220 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d5e3351/279192b1848b4fc4bd03583f251b7534/FLAG9624e782c [2018-11-18 22:31:17,686 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:31:17,687 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.v+cfa-reducer.c [2018-11-18 22:31:17,694 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d5e3351/279192b1848b4fc4bd03583f251b7534/FLAG9624e782c [2018-11-18 22:31:18,026 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d5e3351/279192b1848b4fc4bd03583f251b7534 [2018-11-18 22:31:18,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:31:18,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:31:18,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:31:18,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:31:18,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:31:18,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3014c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18, skipping insertion in model container [2018-11-18 22:31:18,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:31:18,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:31:18,314 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:31:18,320 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:31:18,339 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:31:18,353 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:31:18,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18 WrapperNode [2018-11-18 22:31:18,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:31:18,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:31:18,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:31:18,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:31:18,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (1/1) ... [2018-11-18 22:31:18,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:31:18,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:31:18,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:31:18,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:31:18,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (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:31:18,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:31:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:31:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:31:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:31:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 22:31:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:31:18,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:31:18,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:31:18,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:31:18,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:31:18,904 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:31:18,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:31:18 BoogieIcfgContainer [2018-11-18 22:31:18,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:31:18,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:31:18,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:31:18,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:31:18,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:31:18" (1/3) ... [2018-11-18 22:31:18,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341a0283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:31:18, skipping insertion in model container [2018-11-18 22:31:18,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:18" (2/3) ... [2018-11-18 22:31:18,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341a0283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:31:18, skipping insertion in model container [2018-11-18 22:31:18,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:31:18" (3/3) ... [2018-11-18 22:31:18,913 INFO L112 eAbstractionObserver]: Analyzing ICFG gsv2008_true-unreach-call.c.i.v+cfa-reducer.c [2018-11-18 22:31:18,923 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:31:18,930 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:31:18,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:31:18,973 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:31:18,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:31:18,974 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:31:18,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:31:18,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:31:18,974 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:31:18,974 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:31:18,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:31:18,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:31:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-18 22:31:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:31:19,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:31:19,001 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:31:19,003 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:31:19,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:31:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-18 22:31:19,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:31:19,016 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:31:19,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:31:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:31:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:31:19,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:31:19,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-18 22:31:19,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0bv32;~__return_65~0 := 0bv32; {19#true} is VALID [2018-11-18 22:31:19,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-18 22:31:19,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-18 22:31:19,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-18 22:31:19,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {39#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-18 22:31:19,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {39#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-18 22:31:19,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !!~bvslt32(~main__y~0, 1000000bv32); {39#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-18 22:31:19,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-18 22:31:19,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2018-11-18 22:31:19,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-18 22:31:19,245 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:31:19,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:31:19,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:31:19,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:31:19,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 22:31:19,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:31:19,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:31:19,303 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:31:19,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:31:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:31:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:31:19,314 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-11-18 22:31:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:31:19,534 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-18 22:31:19,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:31:19,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 22:31:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:31:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:31:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-18 22:31:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:31:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-18 22:31:19,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2018-11-18 22:31:19,826 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:31:19,837 INFO L225 Difference]: With dead ends: 26 [2018-11-18 22:31:19,837 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 22:31:19,844 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:31:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 22:31:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 22:31:19,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:31:19,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-18 22:31:19,904 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:31:19,904 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:31:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:31:19,908 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:31:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:31:19,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:31:19,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:31:19,909 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:31:19,909 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:31:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:31:19,912 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:31:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:31:19,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:31:19,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:31:19,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:31:19,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:31:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:31:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 22:31:19,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 22:31:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:31:19,918 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 22:31:19,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:31:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:31:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 22:31:19,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:31:19,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:31:19,919 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:31:19,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:31:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-18 22:31:19,920 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:31:19,920 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:31:19,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:31:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:31:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:31:19,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:31:20,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {131#true} is VALID [2018-11-18 22:31:20,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {131#true} ~__return_main~0 := 0bv32;~__return_65~0 := 0bv32; {131#true} is VALID [2018-11-18 22:31:20,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2018-11-18 22:31:20,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #28#return; {131#true} is VALID [2018-11-18 22:31:20,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret2 := main(); {131#true} is VALID [2018-11-18 22:31:20,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {131#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {151#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-18 22:31:20,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {151#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {155#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} is VALID [2018-11-18 22:31:20,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} assume !!~bvslt32(~main__y~0, 1000000bv32); {159#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} is VALID [2018-11-18 22:31:20,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {163#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (= (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (_ bv50 32)) (_ bv0 32)) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} is VALID [2018-11-18 22:31:20,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (= (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (_ bv50 32)) (_ bv0 32)) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:31:20,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {132#false} is VALID [2018-11-18 22:31:20,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {132#false} assume !false; {132#false} is VALID [2018-11-18 22:31:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:31:20,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:31:21,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {132#false} assume !false; {132#false} is VALID [2018-11-18 22:31:21,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {132#false} is VALID [2018-11-18 22:31:21,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:31:21,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#(or (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {181#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} is VALID [2018-11-18 22:31:21,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#(or (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt main_~main__y~0 (_ bv1000000 32))))} assume !!~bvslt32(~main__y~0, 1000000bv32); {185#(or (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:31:21,438 INFO L273 TraceCheckUtils]: 6: Hoare triple {193#(forall ((main_~main__y~0 (_ BitVec 32))) (or (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt main_~main__y~0 (_ bv1000000 32)))))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {189#(or (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt main_~main__y~0 (_ bv1000000 32))))} is VALID [2018-11-18 22:31:21,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {131#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {193#(forall ((main_~main__y~0 (_ BitVec 32))) (or (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt main_~main__y~0 (_ bv1000000 32)))))} is VALID [2018-11-18 22:31:21,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret2 := main(); {131#true} is VALID [2018-11-18 22:31:21,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #28#return; {131#true} is VALID [2018-11-18 22:31:21,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2018-11-18 22:31:21,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {131#true} ~__return_main~0 := 0bv32;~__return_65~0 := 0bv32; {131#true} is VALID [2018-11-18 22:31:21,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {131#true} is VALID [2018-11-18 22:31:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:31:21,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:31:21,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 22:31:21,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-11-18 22:31:21,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:31:21,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:31:21,564 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:31:21,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:31:21,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:31:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:31:21,565 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-11-18 22:31:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:31:22,230 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-18 22:31:22,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:31:22,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-11-18 22:31:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:31:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:31:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-18 22:31:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:31:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-18 22:31:22,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2018-11-18 22:31:22,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:31:22,358 INFO L225 Difference]: With dead ends: 21 [2018-11-18 22:31:22,358 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 22:31:22,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:31:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 22:31:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 22:31:22,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:31:22,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-18 22:31:22,375 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-18 22:31:22,375 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-18 22:31:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:31:22,378 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-18 22:31:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-18 22:31:22,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:31:22,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:31:22,379 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-18 22:31:22,379 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-18 22:31:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:31:22,381 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-18 22:31:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-18 22:31:22,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:31:22,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:31:22,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:31:22,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:31:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:31:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-18 22:31:22,384 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-11-18 22:31:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:31:22,384 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-18 22:31:22,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:31:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-18 22:31:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:31:22,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:31:22,387 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:31:22,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:31:22,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:31:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash -484853433, now seen corresponding path program 2 times [2018-11-18 22:31:22,388 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:31:22,389 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:31:22,406 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:31:22,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:31:22,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:31:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:31:22,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:31:28,308 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 22:31:41,203 WARN L180 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-18 22:31:43,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2018-11-18 22:31:43,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#true} ~__return_main~0 := 0bv32;~__return_65~0 := 0bv32; {309#true} is VALID [2018-11-18 22:31:43,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-18 22:31:43,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #28#return; {309#true} is VALID [2018-11-18 22:31:43,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret2 := main(); {309#true} is VALID [2018-11-18 22:31:43,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {329#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} is VALID [2018-11-18 22:31:43,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {329#(= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {333#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} is VALID [2018-11-18 22:31:43,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {333#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0))} assume !!~bvslt32(~main__y~0, 1000000bv32); {337#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} is VALID [2018-11-18 22:31:43,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {337#(and (= (bvadd main_~main__x~0 (_ bv50 32)) (_ bv0 32)) (bvslt (_ bv4294966296 32) main_~main__y~0) (bvslt main_~main__y~0 (_ bv1000000 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {341#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} is VALID [2018-11-18 22:31:43,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {341#(and (bvslt (_ bv4294966296 32) (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvslt (bvadd main_~main__y~0 (_ bv4294967295 32)) (_ bv1000000 32)) (= (bvadd main_~main__y~0 (_ bv4294967245 32)) main_~main__x~0))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {345#(exists ((v_main_~main__x~0_10 (_ BitVec 32))) (and (bvslt (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv4294967295 32)) (_ bv1000000 32)) (bvslt v_main_~main__x~0_10 (_ bv0 32)) (= (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv4294967245 32)) v_main_~main__x~0_10) (bvslt (_ bv4294966296 32) (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv4294967295 32))) (= (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv1 32)) main_~main__y~0)))} is VALID [2018-11-18 22:31:45,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {345#(exists ((v_main_~main__x~0_10 (_ BitVec 32))) (and (bvslt (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv4294967295 32)) (_ bv1000000 32)) (bvslt v_main_~main__x~0_10 (_ bv0 32)) (= (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv4294967245 32)) v_main_~main__x~0_10) (bvslt (_ bv4294966296 32) (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv4294967295 32))) (= (bvadd main_~main__x~0 (bvneg v_main_~main__x~0_10) (_ bv1 32)) main_~main__y~0)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {349#(and (exists ((v_main_~main__x~0_10 (_ BitVec 32))) (and (bvslt (_ bv4294966296 32) (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10))) (bvslt v_main_~main__x~0_10 (_ bv0 32)) (= (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv4294967246 32)) v_main_~main__x~0_10) (= (bvadd main_~main__y~0 (_ bv4294967293 32)) (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10))) (bvslt (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10)) (_ bv1000000 32)))) (bvslt (bvadd (bvneg main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} is UNKNOWN [2018-11-18 22:31:48,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {349#(and (exists ((v_main_~main__x~0_10 (_ BitVec 32))) (and (bvslt (_ bv4294966296 32) (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10))) (bvslt v_main_~main__x~0_10 (_ bv0 32)) (= (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv4294967246 32)) v_main_~main__x~0_10) (= (bvadd main_~main__y~0 (_ bv4294967293 32)) (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10))) (bvslt (bvadd main_~main__x~0 (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10)) (_ bv1000000 32)))) (bvslt (bvadd (bvneg main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {353#(and (bvslt (bvadd (bvneg main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)) (exists ((v_main_~main__x~0_10 (_ BitVec 32))) (and (= (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv4294967247 32)) v_main_~main__x~0_10) (= (bvadd main_~main__y~0 (_ bv4294967291 32)) (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10))) (bvslt v_main_~main__x~0_10 (_ bv0 32)) (bvslt (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv1 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv1 32))))))} is UNKNOWN [2018-11-18 22:31:48,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#(and (bvslt (bvadd (bvneg main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)) (exists ((v_main_~main__x~0_10 (_ BitVec 32))) (and (= (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv4294967247 32)) v_main_~main__x~0_10) (= (bvadd main_~main__y~0 (_ bv4294967291 32)) (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10))) (bvslt v_main_~main__x~0_10 (_ bv0 32)) (bvslt (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv1 32)) (_ bv1000000 32)) (bvslt (_ bv4294966296 32) (bvadd main_~main__x~0 (bvneg (bvadd main_~main__y~0 (_ bv4294967295 32))) (bvneg main_~main__y~0) (bvneg v_main_~main__x~0_10) (_ bv1 32))))))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {357#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:31:48,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {310#false} is VALID [2018-11-18 22:31:48,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {310#false} assume !false; {310#false} is VALID [2018-11-18 22:31:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:31:48,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:31:58,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {310#false} assume !false; {310#false} is VALID [2018-11-18 22:31:58,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {367#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {310#false} is VALID [2018-11-18 22:31:58,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {371#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} assume !~bvslt32(~main__x~0, 0bv32);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsgt32(~main__y~0, 0bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {367#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:31:58,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {371#(or (bvsgt main_~main__y~0 (_ bv0 32)) (bvslt main_~main__x~0 (_ bv0 32)))} is VALID [2018-11-18 22:31:58,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {379#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {375#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:32:00,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {383#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv3 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {379#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv2 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32)))} is UNKNOWN [2018-11-18 22:32:02,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {387#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} assume ~bvslt32(~main__x~0, 0bv32);~main__x~0 := ~bvadd32(~main__x~0, ~main__y~0);~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~bvadd32(1bv32, ~main__y~0); {383#(or (not (bvslt main_~main__x~0 (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32)) (bvsgt (bvadd main_~main__y~0 (_ bv3 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} is UNKNOWN [2018-11-18 22:32:02,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {387#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} assume !!~bvslt32(~main__y~0, 1000000bv32); {387#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} is VALID [2018-11-18 22:32:02,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {394#(forall ((main_~main__y~0 (_ BitVec 32))) (or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)))))} assume !!~bvslt32(4294966296bv32, ~main__y~0); {387#(or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32))))} is VALID [2018-11-18 22:32:02,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := 4294967246bv32;~main__y~0 := #t~nondet1;havoc #t~nondet1; {394#(forall ((main_~main__y~0 (_ BitVec 32))) (or (not (bvslt (bvadd (bvmul (_ bv3 32) main_~main__y~0) main_~main__x~0 (_ bv3 32)) (_ bv0 32))) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~main__y~0) main_~main__x~0 (_ bv1 32)) (_ bv0 32))) (bvsgt (bvadd main_~main__y~0 (_ bv4 32)) (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv4 32) main_~main__y~0) main_~main__x~0 (_ bv6 32)) (_ bv0 32)) (not (bvslt (_ bv4294966296 32) main_~main__y~0)) (not (bvslt (bvadd main_~main__y~0 main_~main__x~0) (_ bv0 32)))))} is VALID [2018-11-18 22:32:02,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret2 := main(); {309#true} is VALID [2018-11-18 22:32:02,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #28#return; {309#true} is VALID [2018-11-18 22:32:02,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-18 22:32:02,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#true} ~__return_main~0 := 0bv32;~__return_65~0 := 0bv32; {309#true} is VALID [2018-11-18 22:32:02,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2018-11-18 22:32:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:32:02,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:32:02,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-18 22:32:02,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-11-18 22:32:02,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:32:02,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:32:11,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 20 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-18 22:32:11,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:32:11,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:32:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:32:11,202 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-11-18 22:32:24,137 WARN L180 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-11-18 22:32:28,612 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 22:32:30,652 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-11-18 22:32:32,944 WARN L180 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-18 22:32:36,858 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-11-18 22:32:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:32:37,073 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-18 22:32:37,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:32:37,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-11-18 22:32:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:32:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:32:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-18 22:32:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:32:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-18 22:32:37,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2018-11-18 22:32:47,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 27 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-18 22:32:47,734 INFO L225 Difference]: With dead ends: 26 [2018-11-18 22:32:47,735 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 22:32:47,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:32:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 22:32:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 22:32:47,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:32:47,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 22:32:47,781 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:32:47,781 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:32:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:32:47,783 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-18 22:32:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 22:32:47,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:32:47,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:32:47,785 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:32:47,785 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:32:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:32:47,787 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-18 22:32:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 22:32:47,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:32:47,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:32:47,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:32:47,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:32:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:32:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-18 22:32:47,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2018-11-18 22:32:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:32:47,793 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-18 22:32:47,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:32:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 22:32:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:32:47,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:32:47,794 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:32:47,795 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:32:47,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:32:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash 699088039, now seen corresponding path program 3 times [2018-11-18 22:32:47,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:32:47,796 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:32:47,811 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 22:32:48,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 22:32:48,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:32:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:32:48,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:34:04,176 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 22:34:32,927 WARN L180 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-18 22:34:59,911 WARN L180 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 47 DAG size of output: 45