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/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:40:16,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:40:16,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:40:16,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:40:16,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:40:16,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:40:16,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:40:16,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:40:16,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:40:16,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:40:16,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:40:16,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:40:16,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:40:16,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:40:16,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:40:16,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:40:16,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:40:16,111 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:40:16,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:40:16,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:40:16,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:40:16,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:40:16,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:40:16,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:40:16,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:40:16,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:40:16,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:40:16,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:40:16,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:40:16,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:40:16,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:40:16,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:40:16,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:40:16,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:40:16,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:40:16,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:40:16,141 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:40:16,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:40:16,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:40:16,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:40:16,170 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:40:16,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:40:16,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:40:16,174 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:40:16,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:40:16,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:40:16,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:40:16,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:40:16,175 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:40:16,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:40:16,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:40:16,175 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:40:16,175 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:40:16,177 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:40:16,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:40:16,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:40:16,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:40:16,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:40:16,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:40:16,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:40:16,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:40:16,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:40:16,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:40:16,178 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:40:16,179 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:40:16,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:40:16,179 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:40:16,180 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:40:16,180 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:40:16,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:40:16,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:40:16,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:40:16,266 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:40:16,266 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:40:16,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-14 16:40:16,344 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6248231/bc85b21fe339401594c8b01d7abe0300/FLAG234de9fb5 [2018-11-14 16:40:16,790 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:40:16,791 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-14 16:40:16,798 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6248231/bc85b21fe339401594c8b01d7abe0300/FLAG234de9fb5 [2018-11-14 16:40:16,812 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6248231/bc85b21fe339401594c8b01d7abe0300 [2018-11-14 16:40:16,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:40:16,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:40:16,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:40:16,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:40:16,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:40:16,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:40:16" (1/1) ... [2018-11-14 16:40:16,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38263162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:16, skipping insertion in model container [2018-11-14 16:40:16,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:40:16" (1/1) ... [2018-11-14 16:40:16,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:40:16,879 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:40:17,155 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:40:17,166 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:40:17,199 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:40:17,223 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:40:17,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17 WrapperNode [2018-11-14 16:40:17,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:40:17,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:40:17,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:40:17,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:40:17,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (1/1) ... [2018-11-14 16:40:17,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (1/1) ... [2018-11-14 16:40:17,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (1/1) ... [2018-11-14 16:40:17,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (1/1) ... [2018-11-14 16:40:17,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (1/1) ... [2018-11-14 16:40:17,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (1/1) ... [2018-11-14 16:40:17,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (1/1) ... [2018-11-14 16:40:17,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:40:17,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:40:17,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:40:17,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:40:17,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (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:40:17,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:40:17,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:40:17,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:40:17,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:40:17,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:40:17,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 16:40:17,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:40:17,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:40:17,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:40:17,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:40:18,103 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:40:18,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:40:18 BoogieIcfgContainer [2018-11-14 16:40:18,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:40:18,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:40:18,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:40:18,108 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:40:18,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:40:16" (1/3) ... [2018-11-14 16:40:18,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2083820c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:40:18, skipping insertion in model container [2018-11-14 16:40:18,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:40:17" (2/3) ... [2018-11-14 16:40:18,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2083820c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:40:18, skipping insertion in model container [2018-11-14 16:40:18,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:40:18" (3/3) ... [2018-11-14 16:40:18,113 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-14 16:40:18,123 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:40:18,132 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:40:18,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:40:18,184 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:40:18,185 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:40:18,185 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:40:18,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:40:18,186 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:40:18,186 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:40:18,186 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:40:18,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:40:18,187 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:40:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-14 16:40:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 16:40:18,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:18,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:18,218 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:18,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-14 16:40:18,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:18,231 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:40:18,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:18,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:18,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-14 16:40:18,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-14 16:40:18,355 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #92#return; {31#true} is VALID [2018-11-14 16:40:18,357 INFO L256 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2018-11-14 16:40:18,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {31#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {31#true} is VALID [2018-11-14 16:40:18,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-14 16:40:18,360 INFO L256 TraceCheckUtils]: 6: Hoare triple {32#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {32#false} is VALID [2018-11-14 16:40:18,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-14 16:40:18,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume ~cond == 0bv32; {32#false} is VALID [2018-11-14 16:40:18,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-14 16:40:18,364 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:40:18,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:40:18,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:40:18,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:40:18,374 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:40:18,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:18,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:40:18,476 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:40:18,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:40:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:40:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:40:18,491 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-14 16:40:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:18,754 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-14 16:40:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:40:18,755 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:40:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:40:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 16:40:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:40:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 16:40:18,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-14 16:40:18,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:18,973 INFO L225 Difference]: With dead ends: 39 [2018-11-14 16:40:18,973 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 16:40:18,977 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:40:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 16:40:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 16:40:19,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:19,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 16:40:19,018 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:40:19,018 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:40:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:19,022 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2018-11-14 16:40:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-14 16:40:19,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:19,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:19,023 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:40:19,024 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:40:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:19,029 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2018-11-14 16:40:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-14 16:40:19,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:19,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:19,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:19,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:40:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-14 16:40:19,036 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-14 16:40:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:19,036 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-14 16:40:19,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:40:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-14 16:40:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:40:19,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:19,038 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:19,038 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:19,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-14 16:40:19,039 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:19,039 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:40:19,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:19,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:19,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-14 16:40:19,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-14 16:40:19,249 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #92#return; {183#true} is VALID [2018-11-14 16:40:19,250 INFO L256 TraceCheckUtils]: 3: Hoare triple {183#true} call #t~ret2 := main(); {183#true} is VALID [2018-11-14 16:40:19,259 INFO L273 TraceCheckUtils]: 4: Hoare triple {183#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {200#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:19,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {200#(= main_~x~0 (_ bv0 32))} assume true; {200#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:19,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {184#false} is VALID [2018-11-14 16:40:19,267 INFO L256 TraceCheckUtils]: 7: Hoare triple {184#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {184#false} is VALID [2018-11-14 16:40:19,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2018-11-14 16:40:19,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {184#false} assume ~cond == 0bv32; {184#false} is VALID [2018-11-14 16:40:19,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-14 16:40:19,269 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:40:19,270 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:40:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:40:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:40:19,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:40:19,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:19,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:40:19,304 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:40:19,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:40:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:40:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:40:19,305 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-14 16:40:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:19,503 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-14 16:40:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:40:19,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:40:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:40:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2018-11-14 16:40:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:40:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2018-11-14 16:40:19,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2018-11-14 16:40:19,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:19,946 INFO L225 Difference]: With dead ends: 30 [2018-11-14 16:40:19,947 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 16:40:19,948 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:40:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 16:40:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-14 16:40:19,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:19,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-14 16:40:19,962 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-14 16:40:19,962 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-14 16:40:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:19,965 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2018-11-14 16:40:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2018-11-14 16:40:19,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:19,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:19,966 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-14 16:40:19,966 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-14 16:40:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:19,969 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2018-11-14 16:40:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2018-11-14 16:40:19,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:19,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:19,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:19,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:40:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-14 16:40:19,973 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-14 16:40:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:19,973 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-14 16:40:19,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:40:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-14 16:40:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:40:19,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:19,975 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:19,976 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:19,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-14 16:40:19,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:19,977 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:40:20,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:20,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:20,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-14 16:40:20,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-14 16:40:20,129 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #92#return; {340#true} is VALID [2018-11-14 16:40:20,129 INFO L256 TraceCheckUtils]: 3: Hoare triple {340#true} call #t~ret2 := main(); {340#true} is VALID [2018-11-14 16:40:20,129 INFO L273 TraceCheckUtils]: 4: Hoare triple {340#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {340#true} is VALID [2018-11-14 16:40:20,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-14 16:40:20,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {340#true} assume !!~bvult32(~x~0, 99bv32); {340#true} is VALID [2018-11-14 16:40:20,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {340#true} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:20,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:20,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:20,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:20,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:20,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {366#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {341#false} is VALID [2018-11-14 16:40:20,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {341#false} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {341#false} is VALID [2018-11-14 16:40:20,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {341#false} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {341#false} is VALID [2018-11-14 16:40:20,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {341#false} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {341#false} is VALID [2018-11-14 16:40:20,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {341#false} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {341#false} is VALID [2018-11-14 16:40:20,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {341#false} assume true; {341#false} is VALID [2018-11-14 16:40:20,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#false} assume !~bvult32(~x~0, 99bv32); {341#false} is VALID [2018-11-14 16:40:20,223 INFO L256 TraceCheckUtils]: 19: Hoare triple {341#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {341#false} is VALID [2018-11-14 16:40:20,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {341#false} ~cond := #in~cond; {341#false} is VALID [2018-11-14 16:40:20,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {341#false} assume ~cond == 0bv32; {341#false} is VALID [2018-11-14 16:40:20,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-14 16:40:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:40:20,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:40:20,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:40:20,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:40:20,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:40:20,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:20,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:40:20,375 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-14 16:40:20,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:40:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:40:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:40:20,376 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-14 16:40:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:20,684 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-14 16:40:20,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:40:20,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:40:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:40:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-14 16:40:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:40:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-14 16:40:20,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2018-11-14 16:40:20,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:20,923 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:40:20,923 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 16:40:20,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:40:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 16:40:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-14 16:40:20,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:20,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-14 16:40:20,948 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-14 16:40:20,948 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-14 16:40:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:20,951 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2018-11-14 16:40:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-14 16:40:20,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:20,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:20,952 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-14 16:40:20,953 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-14 16:40:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:20,955 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2018-11-14 16:40:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-14 16:40:20,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:20,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:20,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:20,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:40:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-14 16:40:20,960 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-14 16:40:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:20,960 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-14 16:40:20,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:40:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-14 16:40:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:40:20,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:20,962 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:20,962 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:20,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-14 16:40:20,963 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:20,963 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:40:20,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:21,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:21,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2018-11-14 16:40:21,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 16:40:21,458 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} #92#return; {597#true} is VALID [2018-11-14 16:40:21,458 INFO L256 TraceCheckUtils]: 3: Hoare triple {597#true} call #t~ret2 := main(); {597#true} is VALID [2018-11-14 16:40:21,460 INFO L273 TraceCheckUtils]: 4: Hoare triple {597#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {614#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:21,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {614#(= main_~x~0 (_ bv0 32))} assume true; {614#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:21,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {614#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {614#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:21,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {614#(= main_~x~0 (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {624#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {624#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {628#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:40:21,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {628#(= (_ bv4 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {632#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {632#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {636#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {636#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {640#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {640#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {644#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {644#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {648#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {648#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {652#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {656#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {656#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {660#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {660#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {660#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:21,502 INFO L273 TraceCheckUtils]: 18: Hoare triple {660#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {598#false} is VALID [2018-11-14 16:40:21,502 INFO L256 TraceCheckUtils]: 19: Hoare triple {598#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {598#false} is VALID [2018-11-14 16:40:21,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#false} ~cond := #in~cond; {598#false} is VALID [2018-11-14 16:40:21,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {598#false} assume ~cond == 0bv32; {598#false} is VALID [2018-11-14 16:40:21,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {598#false} assume !false; {598#false} is VALID [2018-11-14 16:40:21,504 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:40:21,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:40:22,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {598#false} assume !false; {598#false} is VALID [2018-11-14 16:40:22,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {598#false} assume ~cond == 0bv32; {598#false} is VALID [2018-11-14 16:40:22,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#false} ~cond := #in~cond; {598#false} is VALID [2018-11-14 16:40:22,298 INFO L256 TraceCheckUtils]: 19: Hoare triple {598#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {598#false} is VALID [2018-11-14 16:40:22,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {691#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {598#false} is VALID [2018-11-14 16:40:22,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {691#(bvult main_~x~0 (_ bv99 32))} assume true; {691#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:40:22,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {691#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:40:22,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {702#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {698#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {706#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {702#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {710#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {706#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {714#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {710#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {718#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {714#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {722#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {718#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {726#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {722#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {730#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {726#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {734#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {730#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {734#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {734#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {734#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume true; {734#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,347 INFO L273 TraceCheckUtils]: 4: Hoare triple {597#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {734#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:22,347 INFO L256 TraceCheckUtils]: 3: Hoare triple {597#true} call #t~ret2 := main(); {597#true} is VALID [2018-11-14 16:40:22,348 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} #92#return; {597#true} is VALID [2018-11-14 16:40:22,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 16:40:22,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2018-11-14 16:40:22,351 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:40:22,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:40:22,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 16:40:22,357 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-14 16:40:22,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:22,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 16:40:22,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:22,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 16:40:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 16:40:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:40:22,455 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 24 states. [2018-11-14 16:40:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:31,591 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2018-11-14 16:40:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 16:40:31,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-14 16:40:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:40:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 153 transitions. [2018-11-14 16:40:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:40:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 153 transitions. [2018-11-14 16:40:31,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 153 transitions. [2018-11-14 16:40:32,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:32,157 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:40:32,157 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 16:40:32,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 16:40:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 16:40:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 60. [2018-11-14 16:40:32,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:32,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 60 states. [2018-11-14 16:40:32,195 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 60 states. [2018-11-14 16:40:32,196 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 60 states. [2018-11-14 16:40:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:32,202 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-11-14 16:40:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-11-14 16:40:32,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:32,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:32,204 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 133 states. [2018-11-14 16:40:32,204 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 133 states. [2018-11-14 16:40:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:32,211 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-11-14 16:40:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-11-14 16:40:32,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:32,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:32,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:32,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 16:40:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-14 16:40:32,216 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 23 [2018-11-14 16:40:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:32,216 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-14 16:40:32,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 16:40:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 16:40:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:40:32,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:32,218 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:32,218 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:32,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:32,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1460845610, now seen corresponding path program 1 times [2018-11-14 16:40:32,219 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:32,219 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:40:32,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:32,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:32,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2018-11-14 16:40:32,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-14 16:40:32,340 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1286#true} {1286#true} #92#return; {1286#true} is VALID [2018-11-14 16:40:32,340 INFO L256 TraceCheckUtils]: 3: Hoare triple {1286#true} call #t~ret2 := main(); {1286#true} is VALID [2018-11-14 16:40:32,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {1286#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1286#true} is VALID [2018-11-14 16:40:32,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-14 16:40:32,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {1286#true} assume !!~bvult32(~x~0, 99bv32); {1286#true} is VALID [2018-11-14 16:40:32,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {1286#true} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(4bv32, ~x~0); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:40:32,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {1312#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;~x~0 := ~bvadd32(2bv32, ~x~0); {1287#false} is VALID [2018-11-14 16:40:32,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {1287#false} assume true; {1287#false} is VALID [2018-11-14 16:40:32,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {1287#false} assume !~bvult32(~x~0, 99bv32); {1287#false} is VALID [2018-11-14 16:40:32,366 INFO L256 TraceCheckUtils]: 19: Hoare triple {1287#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1287#false} is VALID [2018-11-14 16:40:32,366 INFO L273 TraceCheckUtils]: 20: Hoare triple {1287#false} ~cond := #in~cond; {1287#false} is VALID [2018-11-14 16:40:32,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {1287#false} assume ~cond == 0bv32; {1287#false} is VALID [2018-11-14 16:40:32,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2018-11-14 16:40:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:40:32,368 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:40:32,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:40:32,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:40:32,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:40:32,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:32,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:40:32,400 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-14 16:40:32,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:40:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:40:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:40:32,401 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 3 states. [2018-11-14 16:40:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:32,551 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-14 16:40:32,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:40:32,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:40:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:40:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 16:40:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:40:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 16:40:32,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-14 16:40:32,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:32,724 INFO L225 Difference]: With dead ends: 89 [2018-11-14 16:40:32,724 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:40:32,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:40:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:40:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-14 16:40:32,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:32,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-14 16:40:32,745 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-14 16:40:32,745 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-14 16:40:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:32,747 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-14 16:40:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-14 16:40:32,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:32,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:32,748 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-14 16:40:32,749 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-14 16:40:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:32,751 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-14 16:40:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-14 16:40:32,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:32,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:32,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:32,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 16:40:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-14 16:40:32,754 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 23 [2018-11-14 16:40:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:32,755 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-14 16:40:32,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:40:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 16:40:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:40:32,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:32,756 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:32,756 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:32,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-14 16:40:32,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:32,757 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:32,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:40:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:32,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:33,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {1655#true} call ULTIMATE.init(); {1655#true} is VALID [2018-11-14 16:40:33,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {1655#true} assume true; {1655#true} is VALID [2018-11-14 16:40:33,280 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1655#true} {1655#true} #92#return; {1655#true} is VALID [2018-11-14 16:40:33,281 INFO L256 TraceCheckUtils]: 3: Hoare triple {1655#true} call #t~ret2 := main(); {1655#true} is VALID [2018-11-14 16:40:33,281 INFO L273 TraceCheckUtils]: 4: Hoare triple {1655#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1672#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:33,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {1672#(= main_~x~0 (_ bv0 32))} assume true; {1672#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:33,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {1672#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1672#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:33,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {1672#(= main_~x~0 (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1686#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {1686#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1686#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {1686#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1699#(and (= (bvadd main_~x~0 (_ bv3 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {1699#(and (= (bvadd main_~x~0 (_ bv3 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(4bv32, ~x~0); {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {1682#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1706#(and (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,319 INFO L273 TraceCheckUtils]: 15: Hoare triple {1706#(and (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1686#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {1686#(and (= (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1713#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {1713#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume true; {1713#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {1713#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !~bvult32(~x~0, 99bv32); {1713#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:33,351 INFO L256 TraceCheckUtils]: 19: Hoare triple {1713#(and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1723#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:33,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {1723#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1727#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:33,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {1727#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1656#false} is VALID [2018-11-14 16:40:33,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {1656#false} assume !false; {1656#false} is VALID [2018-11-14 16:40:33,358 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:40:33,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:40:34,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {1656#false} assume !false; {1656#false} is VALID [2018-11-14 16:40:34,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {1737#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1656#false} is VALID [2018-11-14 16:40:34,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {1741#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1737#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:40:34,149 INFO L256 TraceCheckUtils]: 19: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1741#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:40:34,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !~bvult32(~x~0, 99bv32); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume true; {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(4bv32, ~x~0); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 4bv32); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {1776#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1745#(= (bvurem main_~y~0 (_ bv2 32)) (bvurem main_~x~0 (_ bv2 32)))} is VALID [2018-11-14 16:40:34,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {1776#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1776#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} is VALID [2018-11-14 16:40:34,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {1783#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1776#(or (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)) (= (bvurem (bvadd main_~x~0 (_ bv2 32)) (_ bv2 32)) (bvurem main_~y~0 (_ bv2 32))))} is VALID [2018-11-14 16:40:34,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {1783#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume !!~bvult32(~x~0, 99bv32); {1783#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:34,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {1783#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} assume true; {1783#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:34,186 INFO L273 TraceCheckUtils]: 4: Hoare triple {1655#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1783#(forall ((main_~y~0 (_ BitVec 32))) (or (= (bvurem main_~y~0 (_ bv2 32)) (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:40:34,187 INFO L256 TraceCheckUtils]: 3: Hoare triple {1655#true} call #t~ret2 := main(); {1655#true} is VALID [2018-11-14 16:40:34,187 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1655#true} {1655#true} #92#return; {1655#true} is VALID [2018-11-14 16:40:34,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {1655#true} assume true; {1655#true} is VALID [2018-11-14 16:40:34,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {1655#true} call ULTIMATE.init(); {1655#true} is VALID [2018-11-14 16:40:34,190 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:40:34,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:40:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-11-14 16:40:34,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-11-14 16:40:34,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:34,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:40:34,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:34,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:40:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:40:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:40:34,350 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 15 states. [2018-11-14 16:40:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:35,769 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 16:40:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:40:35,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-11-14 16:40:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:40:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2018-11-14 16:40:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:40:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2018-11-14 16:40:35,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2018-11-14 16:40:35,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:35,880 INFO L225 Difference]: With dead ends: 75 [2018-11-14 16:40:35,880 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:40:35,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:40:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:40:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:40:35,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:35,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:35,883 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:35,883 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:35,883 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:35,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:35,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:35,883 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:35,884 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:35,884 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:35,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:35,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:35,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:35,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:40:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:40:35,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-14 16:40:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:35,885 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:40:35,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:40:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:35,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:35,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:40:36,254 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:40:36,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:40:36,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:40:36,254 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:40:36,255 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:40:36,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:40:36,255 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (bvurem main_~y~0 (_ bv2 32)))) (or (and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= .cse0 (_ bv0 32)))) (= main_~x~0 (_ bv0 32)) (and (= .cse0 (bvurem main_~x~0 (_ bv2 32))) (forall ((main_~y~0 (_ BitVec 32))) (let ((.cse1 (bvurem main_~y~0 (_ bv2 32)))) (or (= .cse1 (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= .cse1 (_ bv0 32)))))))) [2018-11-14 16:40:36,255 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,255 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (let ((.cse0 (bvurem main_~y~0 (_ bv2 32)))) (or (and (= .cse0 (bvurem main_~x~0 (_ bv2 32))) (forall ((main_~y~0 (_ BitVec 32))) (let ((.cse1 (bvurem main_~y~0 (_ bv2 32)))) (or (= .cse1 (bvurem (bvadd main_~x~0 (_ bv3 32)) (_ bv2 32))) (= .cse1 (_ bv0 32)))))) (and (= (bvadd main_~x~0 (_ bv5 32)) (_ bv0 32)) (not (= .cse0 (_ bv0 32)))))) [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-14 16:40:36,256 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-14 16:40:36,257 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-14 16:40:36,257 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-14 16:40:36,257 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 16:40:36,257 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:40:36,257 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 16:40:36,257 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 16:40:36,257 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 16:40:36,258 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:40:36,259 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:40:36,274 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:36,274 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:40:36,274 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:40:36,274 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 16:40:36,288 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:36,288 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:36,288 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:40:36,288 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 16:40:36,288 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:40:36,289 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 16:40:36,290 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 16:40:36,291 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 16:40:36,291 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:40:36,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-14 16:40:36,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-14 16:40:36,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-14 16:40:36,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-14 16:40:36,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:40:36 BoogieIcfgContainer [2018-11-14 16:40:36,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:40:36,315 INFO L168 Benchmark]: Toolchain (without parser) took 19493.17 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 861.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -492.9 MB). Peak memory consumption was 368.5 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:36,319 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:40:36,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.37 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:40:36,320 INFO L168 Benchmark]: Boogie Preprocessor took 64.25 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:40:36,321 INFO L168 Benchmark]: RCFGBuilder took 815.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:36,323 INFO L168 Benchmark]: TraceAbstraction took 18208.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 123.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.0 MB). Peak memory consumption was 394.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:36,326 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 400.37 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 64.25 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 815.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18208.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 123.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.0 MB). Peak memory consumption was 394.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2018-11-14 16:40:36,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-14 16:40:36,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-14 16:40:36,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2018-11-14 16:40:36,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] Derived loop invariant: ((~bvadd64(x, 5bv32) == 0bv32 && !(~bvurem32(y, 2bv32) == 0bv32)) || x == 0bv32) || (~bvurem32(y, 2bv32) == ~bvurem32(x, 2bv32) && (forall main_~y~0 : bv32 :: ~bvurem32(main_~y~0, 2bv32) == ~bvurem32(~bvadd64(x, 3bv32), 2bv32) || ~bvurem32(main_~y~0, 2bv32) == 0bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 18.0s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 138 SDtfs, 115 SDslu, 246 SDs, 0 SdLazy, 957 SolverSat, 473 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 107 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 76 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 21 NumberOfFragments, 82 HoareAnnotationTreeSize, 14 FomulaSimplifications, 155 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 151 ConstructedInterpolants, 3 QuantifiedInterpolants, 13025 SizeOfPredicates, 5 NumberOfNonLiveVariables, 207 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 4/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...