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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:30:42,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:30:42,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:30:42,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:30:42,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:30:42,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:30:42,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:30:42,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:30:42,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:30:42,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:30:42,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:30:42,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:30:42,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:30:42,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:30:42,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:30:42,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:30:42,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:30:42,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:30:42,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:30:42,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:30:42,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:30:42,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:30:42,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:30:42,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:30:42,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:30:42,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:30:42,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:30:42,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:30:42,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:30:42,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:30:42,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:30:42,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:30:42,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:30:42,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:30:42,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:30:42,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:30:42,496 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-23 11:30:42,529 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:30:42,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:30:42,530 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:30:42,530 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:30:42,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:30:42,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:30:42,532 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:30:42,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:30:42,533 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:30:42,533 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:30:42,533 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:30:42,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:30:42,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:30:42,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:30:42,534 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:30:42,534 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:30:42,534 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:30:42,534 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:30:42,535 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:30:42,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:30:42,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:30:42,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:30:42,535 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:30:42,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:30:42,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:42,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:30:42,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:30:42,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:30:42,536 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:30:42,540 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:30:42,540 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:30:42,540 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:30:42,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:30:42,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:30:42,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:30:42,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:30:42,632 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:30:42,632 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:30:42,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-11-23 11:30:42,692 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cf59686/96315bc24702457cb873666dfa9feb4d/FLAG5c0d58768 [2018-11-23 11:30:43,136 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:30:43,137 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-11-23 11:30:43,144 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cf59686/96315bc24702457cb873666dfa9feb4d/FLAG5c0d58768 [2018-11-23 11:30:43,519 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cf59686/96315bc24702457cb873666dfa9feb4d [2018-11-23 11:30:43,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:30:43,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:30:43,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:43,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:30:43,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:30:43,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680fc3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43, skipping insertion in model container [2018-11-23 11:30:43,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:30:43,572 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:30:43,799 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:43,806 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:30:43,827 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:43,847 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:30:43,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43 WrapperNode [2018-11-23 11:30:43,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:43,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:43,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:30:43,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:30:43,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:43,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:30:43,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:30:43,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:30:43,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (1/1) ... [2018-11-23 11:30:43,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:30:43,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:30:43,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:30:43,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:30:43,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (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-23 11:30:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:30:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:30:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:30:44,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:30:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:30:44,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:30:44,413 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:30:44,413 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:30:44,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:44 BoogieIcfgContainer [2018-11-23 11:30:44,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:30:44,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:30:44,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:30:44,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:30:44,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:43" (1/3) ... [2018-11-23 11:30:44,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761dc037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:44, skipping insertion in model container [2018-11-23 11:30:44,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:43" (2/3) ... [2018-11-23 11:30:44,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761dc037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:44, skipping insertion in model container [2018-11-23 11:30:44,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:44" (3/3) ... [2018-11-23 11:30:44,424 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2018-11-23 11:30:44,436 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:30:44,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:30:44,464 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:30:44,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:30:44,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:30:44,496 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:30:44,496 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:30:44,496 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:30:44,496 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:30:44,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:30:44,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:30:44,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:30:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:30:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:30:44,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:44,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:44,526 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:44,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:30:44,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:44,538 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-23 11:30:44,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:44,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:44,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:30:44,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:30:44,722 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:30:44,722 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 11:30:44,739 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 0bv32;~y~0 := 1bv32; {37#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:44,754 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {21#false} is VALID [2018-11-23 11:30:44,755 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {21#false} is VALID [2018-11-23 11:30:44,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 11:30:44,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:30:44,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:30:44,760 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-23 11:30:44,760 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:44,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:44,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:30:44,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:30:44,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:44,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:30:44,848 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-23 11:30:44,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:30:44,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:30:44,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:44,863 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 11:30:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:45,132 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:30:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:30:45,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:30:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:30:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:30:45,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:30:45,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:45,494 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:30:45,494 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:30:45,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-23 11:30:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:30:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:30:45,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:45,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:45,562 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:45,562 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:45,565 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:45,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:45,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:45,567 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:45,567 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:30:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:45,570 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:30:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:45,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:45,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:45,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:45,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:30:45,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:30:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:45,578 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:30:45,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:30:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:30:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:30:45,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:45,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:45,579 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:45,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:30:45,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:45,580 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-23 11:30:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:45,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:45,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:30:45,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:30:45,758 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:30:45,758 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret1 := main(); {135#true} is VALID [2018-11-23 11:30:45,759 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 0bv32;~y~0 := 1bv32; {152#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:45,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {156#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:45,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {136#false} is VALID [2018-11-23 11:30:45,764 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {136#false} is VALID [2018-11-23 11:30:45,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:30:45,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:30:45,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:30:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:45,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:45,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:30:45,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:30:45,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:30:45,961 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {136#false} is VALID [2018-11-23 11:30:45,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {184#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {136#false} is VALID [2018-11-23 11:30:45,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {184#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-23 11:30:45,964 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 0bv32;~y~0 := 1bv32; {188#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:45,964 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret1 := main(); {135#true} is VALID [2018-11-23 11:30:45,965 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:30:45,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:30:45,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:30:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:45,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:45,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:30:45,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:30:45,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:45,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:30:46,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:46,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:30:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:30:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:46,012 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:30:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:46,327 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:30:46,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:30:46,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:30:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:30:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:30:46,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2018-11-23 11:30:46,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:46,562 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:30:46,563 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:30:46,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:30:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:30:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:30:46,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:46,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:46,729 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:46,730 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:46,732 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:30:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:46,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:46,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:46,733 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:46,733 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:46,735 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:30:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:46,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:46,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:46,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:46,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:30:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:30:46,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:30:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:46,739 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:30:46,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:30:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:30:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:30:46,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:46,740 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:46,740 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:46,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:30:46,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:46,743 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-23 11:30:46,779 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:30:46,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:30:46,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:46,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:47,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:30:47,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:30:47,042 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:30:47,043 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret1 := main(); {297#true} is VALID [2018-11-23 11:30:47,043 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~y~0 := 1bv32; {314#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:30:47,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {314#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {318#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:47,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {322#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:30:47,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {326#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:47,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {330#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:30:47,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~x~0, 6bv32); {298#false} is VALID [2018-11-23 11:30:47,064 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {298#false} is VALID [2018-11-23 11:30:47,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:30:47,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:30:47,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:30:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:47,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:47,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:30:47,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:30:47,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:30:47,381 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {298#false} is VALID [2018-11-23 11:30:47,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {298#false} is VALID [2018-11-23 11:30:47,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {358#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-23 11:30:47,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {366#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {362#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:47,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {370#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {366#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:47,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {370#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:47,396 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~y~0 := 1bv32; {374#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} is VALID [2018-11-23 11:30:47,397 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret1 := main(); {297#true} is VALID [2018-11-23 11:30:47,397 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:30:47,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:30:47,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:30:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:47,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:30:47,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:30:47,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:47,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:30:47,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:47,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:30:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:30:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:30:47,460 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-11-23 11:30:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:48,066 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:30:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:30:48,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:30:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:30:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:30:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:30:48,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2018-11-23 11:30:48,157 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-23 11:30:48,158 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:30:48,158 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:30:48,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:30:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:30:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:30:48,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:48,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:48,219 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:48,219 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:48,221 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:30:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:30:48,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:48,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:48,222 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:48,222 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:30:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:48,224 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:30:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:30:48,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:48,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:48,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:48,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:30:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 11:30:48,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 11:30:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:48,227 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 11:30:48,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:30:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:30:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:30:48,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:48,229 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:48,229 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:48,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 3 times [2018-11-23 11:30:48,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:48,230 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-23 11:30:48,248 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:30:48,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:30:48,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:48,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:48,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 11:30:48,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 11:30:48,809 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {493#true} {493#true} #31#return; {493#true} is VALID [2018-11-23 11:30:48,809 INFO L256 TraceCheckUtils]: 3: Hoare triple {493#true} call #t~ret1 := main(); {493#true} is VALID [2018-11-23 11:30:48,811 INFO L273 TraceCheckUtils]: 4: Hoare triple {493#true} ~x~0 := 0bv32;~y~0 := 1bv32; {510#(= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {510#(= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {514#(= (bvadd main_~y~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {514#(= (bvadd main_~y~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {518#(= (bvadd main_~y~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {518#(= (bvadd main_~y~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {522#(= (bvadd main_~y~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {522#(= (bvadd main_~y~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {526#(= (bvadd main_~y~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {526#(= (bvadd main_~y~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {530#(= (bvadd main_~y~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {530#(= (bvadd main_~y~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {534#(= (bvadd main_~y~0 (_ bv4294967232 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {534#(= (bvadd main_~y~0 (_ bv4294967232 32)) (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {534#(= (bvadd main_~y~0 (_ bv4294967232 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,819 INFO L256 TraceCheckUtils]: 12: Hoare triple {534#(= (bvadd main_~y~0 (_ bv4294967232 32)) (_ bv0 32))} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {541#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {541#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {545#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:48,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {494#false} is VALID [2018-11-23 11:30:48,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 11:30:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:48,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:53,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {494#false} assume !false; {494#false} is VALID [2018-11-23 11:30:53,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {555#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {494#false} is VALID [2018-11-23 11:30:53,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {559#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {555#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:30:53,526 INFO L256 TraceCheckUtils]: 12: Hoare triple {563#(not (= (bvurem main_~y~0 (_ bv3 32)) (_ bv0 32)))} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {559#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:30:53,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {563#(not (= (bvurem main_~y~0 (_ bv3 32)) (_ bv0 32)))} assume !~bvult32(~x~0, 6bv32); {563#(not (= (bvurem main_~y~0 (_ bv3 32)) (_ bv0 32)))} is VALID [2018-11-23 11:30:53,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {570#(not (= (bvurem (bvmul (_ bv2 32) main_~y~0) (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {563#(not (= (bvurem main_~y~0 (_ bv3 32)) (_ bv0 32)))} is VALID [2018-11-23 11:30:54,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {574#(not (= (_ bv0 32) (bvurem (bvmul (_ bv4 32) main_~y~0) (_ bv3 32))))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {570#(not (= (bvurem (bvmul (_ bv2 32) main_~y~0) (_ bv3 32)) (_ bv0 32)))} is VALID [2018-11-23 11:30:54,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {578#(not (= (_ bv0 32) (bvurem (bvmul (_ bv8 32) main_~y~0) (_ bv3 32))))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {574#(not (= (_ bv0 32) (bvurem (bvmul (_ bv4 32) main_~y~0) (_ bv3 32))))} is VALID [2018-11-23 11:30:54,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {582#(not (= (_ bv0 32) (bvurem (bvmul (_ bv16 32) main_~y~0) (_ bv3 32))))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {578#(not (= (_ bv0 32) (bvurem (bvmul (_ bv8 32) main_~y~0) (_ bv3 32))))} is VALID [2018-11-23 11:30:55,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#(not (= (bvurem (bvmul (_ bv32 32) main_~y~0) (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {582#(not (= (_ bv0 32) (bvurem (bvmul (_ bv16 32) main_~y~0) (_ bv3 32))))} is VALID [2018-11-23 11:30:55,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {590#(not (= (bvurem (bvmul (_ bv64 32) main_~y~0) (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {586#(not (= (bvurem (bvmul (_ bv32 32) main_~y~0) (_ bv3 32)) (_ bv0 32)))} is VALID [2018-11-23 11:30:55,880 INFO L273 TraceCheckUtils]: 4: Hoare triple {493#true} ~x~0 := 0bv32;~y~0 := 1bv32; {590#(not (= (bvurem (bvmul (_ bv64 32) main_~y~0) (_ bv3 32)) (_ bv0 32)))} is VALID [2018-11-23 11:30:55,881 INFO L256 TraceCheckUtils]: 3: Hoare triple {493#true} call #t~ret1 := main(); {493#true} is VALID [2018-11-23 11:30:55,881 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {493#true} {493#true} #31#return; {493#true} is VALID [2018-11-23 11:30:55,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {493#true} assume true; {493#true} is VALID [2018-11-23 11:30:55,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2018-11-23 11:30:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:55,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:55,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 11:30:55,885 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 16 [2018-11-23 11:30:55,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:55,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:30:59,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:59,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:30:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:30:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:30:59,147 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 20 states. [2018-11-23 11:31:04,783 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:31:11,094 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:31:16,034 WARN L180 SmtUtils]: Spent 852.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:31:19,767 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 11:31:22,921 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:31:24,779 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 11:31:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:25,844 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:31:25,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:31:25,845 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 16 [2018-11-23 11:31:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:31:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2018-11-23 11:31:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:31:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2018-11-23 11:31:25,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2018-11-23 11:31:37,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 41 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:37,340 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:31:37,340 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:31:37,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:31:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:31:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:31:37,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:37,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:31:37,404 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:31:37,404 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:31:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:37,407 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 11:31:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 11:31:37,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:37,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:37,408 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:31:37,409 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:31:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:37,412 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 11:31:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 11:31:37,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:37,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:37,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:37,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:31:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 11:31:37,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 16 [2018-11-23 11:31:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:37,415 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 11:31:37,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:31:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 11:31:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:31:37,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:37,417 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:37,417 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:37,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 4 times [2018-11-23 11:31:37,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:37,419 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-23 11:31:37,436 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:31:37,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:31:37,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:31:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:37,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:37,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2018-11-23 11:31:37,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {790#true} assume true; {790#true} is VALID [2018-11-23 11:31:37,672 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} #31#return; {790#true} is VALID [2018-11-23 11:31:37,673 INFO L256 TraceCheckUtils]: 3: Hoare triple {790#true} call #t~ret1 := main(); {790#true} is VALID [2018-11-23 11:31:37,674 INFO L273 TraceCheckUtils]: 4: Hoare triple {790#true} ~x~0 := 0bv32;~y~0 := 1bv32; {807#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:31:37,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {807#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {811#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:37,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {815#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:31:37,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {819#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:37,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {819#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {823#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:31:37,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {823#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {827#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:37,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {827#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {831#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:31:37,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {831#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:37,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {791#false} assume !~bvult32(~x~0, 6bv32); {791#false} is VALID [2018-11-23 11:31:37,685 INFO L256 TraceCheckUtils]: 20: Hoare triple {791#false} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {791#false} is VALID [2018-11-23 11:31:37,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {791#false} ~cond := #in~cond; {791#false} is VALID [2018-11-23 11:31:37,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {791#false} assume 0bv32 == ~cond; {791#false} is VALID [2018-11-23 11:31:37,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {791#false} assume !false; {791#false} is VALID [2018-11-23 11:31:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:31:37,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:31:38,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {791#false} assume !false; {791#false} is VALID [2018-11-23 11:31:38,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {791#false} assume 0bv32 == ~cond; {791#false} is VALID [2018-11-23 11:31:38,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {791#false} ~cond := #in~cond; {791#false} is VALID [2018-11-23 11:31:38,007 INFO L256 TraceCheckUtils]: 20: Hoare triple {791#false} call __VERIFIER_assert(~bvurem32(~y~0, 3bv32)); {791#false} is VALID [2018-11-23 11:31:38,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {791#false} assume !~bvult32(~x~0, 6bv32); {791#false} is VALID [2018-11-23 11:31:38,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {791#false} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {907#(not (bvult main_~x~0 (_ bv6 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {791#false} is VALID [2018-11-23 11:31:38,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {911#(not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {907#(not (bvult main_~x~0 (_ bv6 32)))} is VALID [2018-11-23 11:31:38,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {915#(not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {911#(not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32)))} is VALID [2018-11-23 11:31:38,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {919#(not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {915#(not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32)))} is VALID [2018-11-23 11:31:38,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {923#(not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {919#(not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32)))} is VALID [2018-11-23 11:31:38,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {927#(not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv6 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {923#(not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32)))} is VALID [2018-11-23 11:31:38,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {931#(not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv6 32)))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {927#(not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv6 32)))} is VALID [2018-11-23 11:31:38,049 INFO L273 TraceCheckUtils]: 4: Hoare triple {790#true} ~x~0 := 0bv32;~y~0 := 1bv32; {931#(not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv6 32)))} is VALID [2018-11-23 11:31:38,049 INFO L256 TraceCheckUtils]: 3: Hoare triple {790#true} call #t~ret1 := main(); {790#true} is VALID [2018-11-23 11:31:38,049 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} #31#return; {790#true} is VALID [2018-11-23 11:31:38,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {790#true} assume true; {790#true} is VALID [2018-11-23 11:31:38,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2018-11-23 11:31:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:31:38,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:31:38,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:31:38,064 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 11:31:38,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:38,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:31:38,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:38,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:31:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:31:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:31:38,146 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 16 states. [2018-11-23 11:31:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:38,502 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 11:31:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:31:38,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-11-23 11:31:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:31:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2018-11-23 11:31:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:31:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2018-11-23 11:31:38,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 18 transitions. [2018-11-23 11:31:38,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:38,542 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:31:38,543 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:31:38,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:31:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:31:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:31:38,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:38,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:31:38,545 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:31:38,545 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:31:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:38,545 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:31:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:31:38,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:38,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:38,546 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:31:38,546 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:31:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:38,546 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:31:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:31:38,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:38,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:38,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:38,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:31:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:31:38,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-23 11:31:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:38,548 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:31:38,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:31:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:31:38,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:38,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:31:38,944 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2018-11-23 11:31:39,112 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-23 11:31:39,122 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:31:39,123 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:31:39,123 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:31:39,123 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:31:39,123 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:31:39,123 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:31:39,123 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-23 11:31:39,123 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-23 11:31:39,124 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-23 11:31:39,124 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 14) the Hoare annotation is: (or (and (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv4294967288 32)) (_ bv0 32))) (and (= (bvadd main_~y~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd main_~y~0 (_ bv4294967264 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~x~0 (_ bv0 32))) (and (= (_ bv4 32) main_~x~0) (= (bvadd main_~y~0 (_ bv4294967280 32)) (_ bv0 32))) (and (= (_ bv2 32) main_~x~0) (= (bvadd main_~y~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (_ bv6 32) main_~x~0) (= (bvadd main_~y~0 (_ bv4294967232 32)) (_ bv0 32)))) [2018-11-23 11:31:39,124 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (not (= (bvurem main_~y~0 (_ bv3 32)) (_ bv0 32))) [2018-11-23 11:31:39,124 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:31:39,124 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 11:31:39,125 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 11:31:39,125 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:31:39,125 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 11:31:39,125 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 11:31:39,127 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:31:39,128 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:31:39,128 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:31:39,128 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:31:39,166 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:31:39,166 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:31:39,166 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:31:39,166 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:31:39,167 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:31:39,167 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:31:39,167 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:31:39,167 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:31:39,167 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:31:39,167 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:31:39,167 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:31:39,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:39 BoogieIcfgContainer [2018-11-23 11:31:39,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:31:39,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:31:39,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:31:39,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:31:39,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:44" (3/4) ... [2018-11-23 11:31:39,185 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:31:39,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:31:39,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:31:39,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:31:39,196 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:31:39,196 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:31:39,196 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:31:39,238 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i-witness.graphml [2018-11-23 11:31:39,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:31:39,240 INFO L168 Benchmark]: Toolchain (without parser) took 55710.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -259.9 MB). Peak memory consumption was 447.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:31:39,241 INFO L168 Benchmark]: CDTParser took 0.19 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-23 11:31:39,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.35 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-23 11:31:39,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.17 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-23 11:31:39,243 INFO L168 Benchmark]: Boogie Preprocessor took 32.40 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-23 11:31:39,244 INFO L168 Benchmark]: RCFGBuilder took 504.15 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:31:39,244 INFO L168 Benchmark]: TraceAbstraction took 54765.09 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 476.4 MB). Peak memory consumption was 476.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:31:39,245 INFO L168 Benchmark]: Witness Printer took 58.62 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:31:39,250 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.35 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 Procedure Inliner took 27.17 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. * Boogie Preprocessor took 32.40 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 504.15 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54765.09 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 476.4 MB). Peak memory consumption was 476.4 MB. Max. memory is 7.1 GB. * Witness Printer took 58.62 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant Derived loop invariant: ((((((~bvadd64(x, 4294967293bv32) == 0bv32 && ~bvadd64(y, 4294967288bv32) == 0bv32) || (~bvadd64(y, 4294967294bv32) == 0bv32 && ~bvadd64(x, 4294967295bv32) == 0bv32)) || (~bvadd64(y, 4294967264bv32) == 0bv32 && ~bvadd64(x, 4294967291bv32) == 0bv32)) || (~bvadd64(y, 4294967295bv32) == 0bv32 && x == 0bv32)) || (4bv32 == x && ~bvadd64(y, 4294967280bv32) == 0bv32)) || (2bv32 == x && ~bvadd64(y, 4294967292bv32) == 0bv32)) || (6bv32 == x && ~bvadd64(y, 4294967232bv32) == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 54.6s OverallTime, 5 OverallIterations, 14 TraceHistogramMax, 40.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 50 SDtfs, 30 SDslu, 216 SDs, 0 SdLazy, 209 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 24.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 33 NumberOfFragments, 81 HoareAnnotationTreeSize, 18 FomulaSimplifications, 210 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 5370 SizeOfPredicates, 5 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 168/274 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...