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/loops/trex01_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:26:08,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:26:08,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:26:08,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:26:08,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:26:08,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:26:08,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:26:08,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:26:08,980 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:26:08,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:26:08,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:26:08,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:26:08,983 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:26:08,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:26:08,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:26:08,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:26:08,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:26:08,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:26:08,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:26:08,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:26:08,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:26:09,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:26:09,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:26:09,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:26:09,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:26:09,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:26:09,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:26:09,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:26:09,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:26:09,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:26:09,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:26:09,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:26:09,028 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:26:09,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:26:09,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:26:09,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:26:09,034 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:26:09,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:26:09,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:26:09,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:26:09,069 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:26:09,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:26:09,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:26:09,070 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:26:09,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:26:09,070 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:26:09,070 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:26:09,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:26:09,071 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:26:09,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:26:09,071 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:26:09,071 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:26:09,071 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:26:09,072 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:26:09,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:26:09,072 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:26:09,072 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:26:09,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:26:09,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:26:09,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:26:09,073 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:26:09,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:09,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:26:09,074 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:26:09,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:26:09,074 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:26:09,074 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:26:09,074 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:26:09,075 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:26:09,075 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:26:09,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:26:09,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:26:09,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:26:09,143 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:26:09,143 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:26:09,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex01_true-unreach-call_true-termination.i [2018-11-23 11:26:09,197 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675b1ebf4/dcd45f51571f434cbe3755efff660eed/FLAG5ac57789c [2018-11-23 11:26:09,647 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:26:09,648 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex01_true-unreach-call_true-termination.i [2018-11-23 11:26:09,656 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675b1ebf4/dcd45f51571f434cbe3755efff660eed/FLAG5ac57789c [2018-11-23 11:26:10,062 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675b1ebf4/dcd45f51571f434cbe3755efff660eed [2018-11-23 11:26:10,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:26:10,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:26:10,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:10,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:26:10,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:26:10,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c949a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10, skipping insertion in model container [2018-11-23 11:26:10,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:26:10,130 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:26:10,381 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:10,396 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:26:10,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:10,436 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:26:10,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10 WrapperNode [2018-11-23 11:26:10,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:10,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:10,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:26:10,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:26:10,446 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:26:10" (1/1) ... [2018-11-23 11:26:10,453 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:26:10" (1/1) ... [2018-11-23 11:26:10,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:10,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:26:10,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:26:10,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:26:10,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (1/1) ... [2018-11-23 11:26:10,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:26:10,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:26:10,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:26:10,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:26:10,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (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:26:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:26:10,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:26:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 11:26:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 11:26:10,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:26:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:26:10,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:26:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:26:10,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:26:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:26:11,217 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:26:11,218 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:26:11,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:11 BoogieIcfgContainer [2018-11-23 11:26:11,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:26:11,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:26:11,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:26:11,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:26:11,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:26:10" (1/3) ... [2018-11-23 11:26:11,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e50860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:11, skipping insertion in model container [2018-11-23 11:26:11,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:10" (2/3) ... [2018-11-23 11:26:11,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e50860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:11, skipping insertion in model container [2018-11-23 11:26:11,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:11" (3/3) ... [2018-11-23 11:26:11,227 INFO L112 eAbstractionObserver]: Analyzing ICFG trex01_true-unreach-call_true-termination.i [2018-11-23 11:26:11,236 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:26:11,245 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:26:11,265 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:26:11,300 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:26:11,301 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:26:11,301 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:26:11,302 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:26:11,303 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:26:11,303 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:26:11,303 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:26:11,304 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:26:11,304 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:26:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 11:26:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:26:11,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:11,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:11,337 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:11,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1886719170, now seen corresponding path program 1 times [2018-11-23 11:26:11,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:11,349 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:26:11,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:11,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:11,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 11:26:11,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 11:26:11,520 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #82#return; {34#true} is VALID [2018-11-23 11:26:11,520 INFO L256 TraceCheckUtils]: 3: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2018-11-23 11:26:11,521 INFO L273 TraceCheckUtils]: 4: Hoare triple {34#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {34#true} is VALID [2018-11-23 11:26:11,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume 0bv8 != ~c~1; {34#true} is VALID [2018-11-23 11:26:11,522 INFO L256 TraceCheckUtils]: 6: Hoare triple {34#true} call f(1bv32); {34#true} is VALID [2018-11-23 11:26:11,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {34#true} is VALID [2018-11-23 11:26:11,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume !!~bvsle32(~k~0, 1073741823bv32); {34#true} is VALID [2018-11-23 11:26:11,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 11:26:11,523 INFO L256 TraceCheckUtils]: 10: Hoare triple {35#false} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {35#false} is VALID [2018-11-23 11:26:11,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-23 11:26:11,524 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume 0bv32 == ~cond; {35#false} is VALID [2018-11-23 11:26:11,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 11:26:11,527 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:26:11,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:11,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:11,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:26:11,541 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:26:11,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:11,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:26:11,633 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:26:11,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:26:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:26:11,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:11,647 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 11:26:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:12,124 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2018-11-23 11:26:12,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:26:12,125 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:26:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 11:26:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 11:26:12,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-23 11:26:12,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:12,434 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:26:12,434 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:26:12,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:26:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 11:26:12,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:12,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 11:26:12,483 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:26:12,484 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:26:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:12,487 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 11:26:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:26:12,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:12,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:12,489 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:26:12,489 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:26:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:12,492 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 11:26:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:26:12,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:12,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:12,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:12,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:26:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 11:26:12,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-11-23 11:26:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:12,499 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 11:26:12,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:26:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 11:26:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:26:12,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:12,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:12,501 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:12,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1883025086, now seen corresponding path program 1 times [2018-11-23 11:26:12,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:12,502 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:26:12,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:12,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:12,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {200#true} is VALID [2018-11-23 11:26:12,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2018-11-23 11:26:12,710 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #82#return; {200#true} is VALID [2018-11-23 11:26:12,710 INFO L256 TraceCheckUtils]: 3: Hoare triple {200#true} call #t~ret6 := main(); {200#true} is VALID [2018-11-23 11:26:12,711 INFO L273 TraceCheckUtils]: 4: Hoare triple {200#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {200#true} is VALID [2018-11-23 11:26:12,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {200#true} assume 0bv8 != ~c~1; {200#true} is VALID [2018-11-23 11:26:12,711 INFO L256 TraceCheckUtils]: 6: Hoare triple {200#true} call f(1bv32); {200#true} is VALID [2018-11-23 11:26:12,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {200#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {226#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:12,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {226#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~k~0, 1073741823bv32); {226#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:12,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~z~0, ~k~0); {226#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:12,726 INFO L256 TraceCheckUtils]: 10: Hoare triple {226#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {236#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:12,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {236#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {240#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:12,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {240#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {201#false} is VALID [2018-11-23 11:26:12,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {201#false} assume !false; {201#false} is VALID [2018-11-23 11:26:12,733 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:26:12,733 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:12,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:12,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:26:12,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:26:12,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:12,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:26:12,766 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:26:12,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:26:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:26:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:26:12,767 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 5 states. [2018-11-23 11:26:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:13,387 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:26:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:26:13,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:26:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 11:26:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 11:26:13,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 11:26:13,426 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:26:13,429 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:26:13,429 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:26:13,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:26:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:26:13,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:13,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:26:13,449 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:26:13,449 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:26:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:13,451 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:26:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:26:13,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:13,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:13,452 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:26:13,452 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:26:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:13,455 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:26:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:26:13,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:13,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:13,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:13,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:26:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:26:13,459 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-11-23 11:26:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:13,460 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:26:13,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:26:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:26:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:26:13,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:13,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:13,461 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:13,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1759133733, now seen corresponding path program 1 times [2018-11-23 11:26:13,462 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:13,462 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:26:13,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:13,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:13,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2018-11-23 11:26:13,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2018-11-23 11:26:13,674 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #82#return; {345#true} is VALID [2018-11-23 11:26:13,675 INFO L256 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret6 := main(); {345#true} is VALID [2018-11-23 11:26:13,675 INFO L273 TraceCheckUtils]: 4: Hoare triple {345#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {345#true} is VALID [2018-11-23 11:26:13,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {345#true} assume 0bv8 != ~c~1; {345#true} is VALID [2018-11-23 11:26:13,676 INFO L256 TraceCheckUtils]: 6: Hoare triple {345#true} call f(1bv32); {345#true} is VALID [2018-11-23 11:26:13,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {345#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {371#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:13,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {371#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~k~0, 1073741823bv32); {371#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:13,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {371#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {378#(= (bvadd f_~z~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:13,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#(= (bvadd f_~z~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~z~0, ~k~0); {378#(= (bvadd f_~z~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:13,680 INFO L256 TraceCheckUtils]: 11: Hoare triple {378#(= (bvadd f_~z~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {385#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:13,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {389#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:13,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {389#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {346#false} is VALID [2018-11-23 11:26:13,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {346#false} assume !false; {346#false} is VALID [2018-11-23 11:26:13,685 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:26:13,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:14,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {346#false} assume !false; {346#false} is VALID [2018-11-23 11:26:14,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {346#false} is VALID [2018-11-23 11:26:14,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {403#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {399#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:26:14,071 INFO L256 TraceCheckUtils]: 11: Hoare triple {407#(bvsge f_~z~0 (_ bv1 32))} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {403#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:26:14,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {407#(bvsge f_~z~0 (_ bv1 32))} assume !~bvslt32(~z~0, ~k~0); {407#(bvsge f_~z~0 (_ bv1 32))} is VALID [2018-11-23 11:26:14,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {414#(bvsge (bvmul (_ bv2 32) f_~z~0) (_ bv1 32))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {407#(bvsge f_~z~0 (_ bv1 32))} is VALID [2018-11-23 11:26:14,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {414#(bvsge (bvmul (_ bv2 32) f_~z~0) (_ bv1 32))} assume !!~bvsle32(~k~0, 1073741823bv32); {414#(bvsge (bvmul (_ bv2 32) f_~z~0) (_ bv1 32))} is VALID [2018-11-23 11:26:14,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {345#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {414#(bvsge (bvmul (_ bv2 32) f_~z~0) (_ bv1 32))} is VALID [2018-11-23 11:26:14,087 INFO L256 TraceCheckUtils]: 6: Hoare triple {345#true} call f(1bv32); {345#true} is VALID [2018-11-23 11:26:14,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {345#true} assume 0bv8 != ~c~1; {345#true} is VALID [2018-11-23 11:26:14,088 INFO L273 TraceCheckUtils]: 4: Hoare triple {345#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {345#true} is VALID [2018-11-23 11:26:14,088 INFO L256 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret6 := main(); {345#true} is VALID [2018-11-23 11:26:14,088 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #82#return; {345#true} is VALID [2018-11-23 11:26:14,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2018-11-23 11:26:14,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2018-11-23 11:26:14,090 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:26:14,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:14,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:26:14,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-23 11:26:14,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:14,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:26:14,167 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:26:14,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:26:14,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:26:14,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:26:14,168 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-11-23 11:26:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:14,657 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 11:26:14,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:26:14,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-23 11:26:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:26:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-23 11:26:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:26:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-23 11:26:14,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2018-11-23 11:26:14,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:14,720 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:26:14,720 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:26:14,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:26:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:26:14,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:14,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:26:14,740 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:26:14,741 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:26:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:14,743 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:26:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:26:14,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:14,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:14,744 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:26:14,744 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:26:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:14,746 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:26:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:26:14,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:14,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:14,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:14,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:26:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:26:14,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2018-11-23 11:26:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:14,750 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:26:14,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:26:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:26:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:26:14,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:14,752 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:14,752 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:14,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1787203070, now seen corresponding path program 2 times [2018-11-23 11:26:14,753 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:14,753 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:26:14,770 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:14,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:14,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:14,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:15,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2018-11-23 11:26:15,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {567#true} assume true; {567#true} is VALID [2018-11-23 11:26:15,227 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {567#true} {567#true} #82#return; {567#true} is VALID [2018-11-23 11:26:15,227 INFO L256 TraceCheckUtils]: 3: Hoare triple {567#true} call #t~ret6 := main(); {567#true} is VALID [2018-11-23 11:26:15,228 INFO L273 TraceCheckUtils]: 4: Hoare triple {567#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2018-11-23 11:26:15,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {567#true} assume 0bv8 != ~c~1; {567#true} is VALID [2018-11-23 11:26:15,229 INFO L256 TraceCheckUtils]: 6: Hoare triple {567#true} call f(1bv32); {567#true} is VALID [2018-11-23 11:26:15,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {567#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {593#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:15,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {593#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~k~0, 1073741823bv32); {593#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:15,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {593#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {600#(and (= (bvadd f_~z~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:15,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {600#(and (= (bvadd f_~z~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {604#(and (bvslt (_ bv1 32) f_~k~0) (= (bvadd f_~z~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:15,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#(and (bvslt (_ bv1 32) f_~k~0) (= (bvadd f_~z~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {608#(and (bvslt (_ bv1 32) f_~k~0) (= (bvadd f_~z~0 (_ bv4294967288 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:15,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {608#(and (bvslt (_ bv1 32) f_~k~0) (= (bvadd f_~z~0 (_ bv4294967288 32)) (_ bv0 32)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {612#(and (= (bvadd f_~z~0 (_ bv4294967280 32)) (_ bv0 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:15,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {612#(and (= (bvadd f_~z~0 (_ bv4294967280 32)) (_ bv0 32)) (bvslt (_ bv1 32) f_~k~0))} assume !~bvslt32(~z~0, ~k~0); {616#(= (bvadd f_~z~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:15,242 INFO L256 TraceCheckUtils]: 14: Hoare triple {616#(= (bvadd f_~z~0 (_ bv4294967280 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {620#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:15,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {620#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {624#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:15,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {624#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {568#false} is VALID [2018-11-23 11:26:15,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {568#false} assume !false; {568#false} is VALID [2018-11-23 11:26:15,247 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:26:15,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:15,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {568#false} assume !false; {568#false} is VALID [2018-11-23 11:26:15,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {634#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {568#false} is VALID [2018-11-23 11:26:15,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {634#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:26:15,786 INFO L256 TraceCheckUtils]: 14: Hoare triple {642#(bvsge f_~z~0 (_ bv1 32))} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {638#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:26:15,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#(or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0))} assume !~bvslt32(~z~0, ~k~0); {642#(bvsge f_~z~0 (_ bv1 32))} is VALID [2018-11-23 11:26:15,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {650#(or (bvsge (bvmul (_ bv2 32) f_~z~0) (_ bv1 32)) (bvslt (bvmul (_ bv2 32) f_~z~0) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {646#(or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0))} is VALID [2018-11-23 11:26:15,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {654#(or (bvslt (bvmul (_ bv4 32) f_~z~0) f_~k~0) (bvsge (bvmul (_ bv4 32) f_~z~0) (_ bv1 32)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {650#(or (bvsge (bvmul (_ bv2 32) f_~z~0) (_ bv1 32)) (bvslt (bvmul (_ bv2 32) f_~z~0) f_~k~0))} is VALID [2018-11-23 11:26:15,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {658#(or (bvsge (bvmul (_ bv8 32) f_~z~0) (_ bv1 32)) (bvslt (bvmul (_ bv8 32) f_~z~0) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {654#(or (bvslt (bvmul (_ bv4 32) f_~z~0) f_~k~0) (bvsge (bvmul (_ bv4 32) f_~z~0) (_ bv1 32)))} is VALID [2018-11-23 11:26:15,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {662#(or (forall ((f_~k~0 (_ BitVec 32))) (or (not (bvslt f_~z~0 f_~k~0)) (bvslt (bvmul (_ bv16 32) f_~z~0) f_~k~0))) (bvsge (bvmul (_ bv16 32) f_~z~0) (_ bv1 32)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {658#(or (bvsge (bvmul (_ bv8 32) f_~z~0) (_ bv1 32)) (bvslt (bvmul (_ bv8 32) f_~z~0) f_~k~0))} is VALID [2018-11-23 11:26:15,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {662#(or (forall ((f_~k~0 (_ BitVec 32))) (or (not (bvslt f_~z~0 f_~k~0)) (bvslt (bvmul (_ bv16 32) f_~z~0) f_~k~0))) (bvsge (bvmul (_ bv16 32) f_~z~0) (_ bv1 32)))} assume !!~bvsle32(~k~0, 1073741823bv32); {662#(or (forall ((f_~k~0 (_ BitVec 32))) (or (not (bvslt f_~z~0 f_~k~0)) (bvslt (bvmul (_ bv16 32) f_~z~0) f_~k~0))) (bvsge (bvmul (_ bv16 32) f_~z~0) (_ bv1 32)))} is VALID [2018-11-23 11:26:15,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {567#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {662#(or (forall ((f_~k~0 (_ BitVec 32))) (or (not (bvslt f_~z~0 f_~k~0)) (bvslt (bvmul (_ bv16 32) f_~z~0) f_~k~0))) (bvsge (bvmul (_ bv16 32) f_~z~0) (_ bv1 32)))} is VALID [2018-11-23 11:26:15,871 INFO L256 TraceCheckUtils]: 6: Hoare triple {567#true} call f(1bv32); {567#true} is VALID [2018-11-23 11:26:15,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {567#true} assume 0bv8 != ~c~1; {567#true} is VALID [2018-11-23 11:26:15,871 INFO L273 TraceCheckUtils]: 4: Hoare triple {567#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2018-11-23 11:26:15,872 INFO L256 TraceCheckUtils]: 3: Hoare triple {567#true} call #t~ret6 := main(); {567#true} is VALID [2018-11-23 11:26:15,872 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {567#true} {567#true} #82#return; {567#true} is VALID [2018-11-23 11:26:15,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {567#true} assume true; {567#true} is VALID [2018-11-23 11:26:15,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2018-11-23 11:26:15,874 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:26:15,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:15,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:26:15,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-11-23 11:26:15,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:15,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:26:16,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:16,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:26:16,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:26:16,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:26:16,062 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 18 states. [2018-11-23 11:26:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:17,472 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 11:26:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:26:17,472 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-11-23 11:26:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:26:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2018-11-23 11:26:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:26:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2018-11-23 11:26:17,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 41 transitions. [2018-11-23 11:26:17,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:17,621 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:26:17,622 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:26:17,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:26:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:26:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:26:17,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:17,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:26:17,671 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:26:17,671 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:26:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:17,675 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:26:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:26:17,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:17,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:17,676 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:26:17,676 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:26:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:17,679 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:26:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:26:17,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:17,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:17,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:17,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:26:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 11:26:17,683 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2018-11-23 11:26:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:17,683 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 11:26:17,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:26:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:26:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:26:17,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:17,685 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:17,685 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:17,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash 56840414, now seen corresponding path program 3 times [2018-11-23 11:26:17,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:17,686 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:26:17,705 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:26:17,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:26:17,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:17,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:17,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {865#true} call ULTIMATE.init(); {865#true} is VALID [2018-11-23 11:26:17,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {865#true} assume true; {865#true} is VALID [2018-11-23 11:26:17,951 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {865#true} {865#true} #82#return; {865#true} is VALID [2018-11-23 11:26:17,951 INFO L256 TraceCheckUtils]: 3: Hoare triple {865#true} call #t~ret6 := main(); {865#true} is VALID [2018-11-23 11:26:17,951 INFO L273 TraceCheckUtils]: 4: Hoare triple {865#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {865#true} is VALID [2018-11-23 11:26:17,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {865#true} assume 0bv8 != ~c~1; {865#true} is VALID [2018-11-23 11:26:17,952 INFO L256 TraceCheckUtils]: 6: Hoare triple {865#true} call f(1bv32); {865#true} is VALID [2018-11-23 11:26:17,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {865#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {891#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:17,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {891#(= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~k~0, 1073741823bv32); {895#(and (bvsle f_~k~0 (_ bv1073741823 32)) (= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:17,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {895#(and (bvsle f_~k~0 (_ bv1073741823 32)) (= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} is VALID [2018-11-23 11:26:17,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {899#(and (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))} assume !~bvslt32(~z~0, ~k~0); {930#(exists ((f_~k~0 (_ BitVec 32))) (and (not (bvslt f_~z~0 f_~k~0)) (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0)))} is VALID [2018-11-23 11:26:17,978 INFO L256 TraceCheckUtils]: 20: Hoare triple {930#(exists ((f_~k~0 (_ BitVec 32))) (and (not (bvslt f_~z~0 f_~k~0)) (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0)))} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {934#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:17,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {934#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {938#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:17,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {938#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {866#false} is VALID [2018-11-23 11:26:17,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {866#false} assume !false; {866#false} is VALID [2018-11-23 11:26:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 11:26:17,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:18,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {866#false} assume !false; {866#false} is VALID [2018-11-23 11:26:18,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {948#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {866#false} is VALID [2018-11-23 11:26:18,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {952#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {948#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:26:18,390 INFO L256 TraceCheckUtils]: 20: Hoare triple {956#(bvsge f_~z~0 (_ bv1 32))} call __VERIFIER_assert((if ~bvsge32(~z~0, 1bv32) then 1bv32 else 0bv32)); {952#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:26:18,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !~bvslt32(~z~0, ~k~0); {956#(bvsge f_~z~0 (_ bv1 32))} is VALID [2018-11-23 11:26:18,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {991#(or (forall ((v_prenex_1 (_ BitVec 32))) (or (bvslt v_prenex_1 f_~k~0) (bvsge v_prenex_1 (_ bv1 32)))) (not (bvslt f_~z~0 f_~k~0)))} assume !!~bvslt32(~z~0, ~k~0);~z~0 := ~bvmul32(2bv32, ~z~0); {960#(forall ((f_~z~0 (_ BitVec 32))) (or (bvsge f_~z~0 (_ bv1 32)) (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {995#(forall ((f_~k~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (bvsle f_~k~0 (_ bv1073741823 32))) (not (bvslt f_~z~0 f_~k~0)) (bvslt v_prenex_1 f_~k~0) (bvsge v_prenex_1 (_ bv1 32))))} assume !!~bvsle32(~k~0, 1073741823bv32); {991#(or (forall ((v_prenex_1 (_ BitVec 32))) (or (bvslt v_prenex_1 f_~k~0) (bvsge v_prenex_1 (_ bv1 32)))) (not (bvslt f_~z~0 f_~k~0)))} is VALID [2018-11-23 11:26:18,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {865#true} ~d := #in~d;~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1bv32; {995#(forall ((f_~k~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (not (bvsle f_~k~0 (_ bv1073741823 32))) (not (bvslt f_~z~0 f_~k~0)) (bvslt v_prenex_1 f_~k~0) (bvsge v_prenex_1 (_ bv1 32))))} is VALID [2018-11-23 11:26:18,425 INFO L256 TraceCheckUtils]: 6: Hoare triple {865#true} call f(1bv32); {865#true} is VALID [2018-11-23 11:26:18,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {865#true} assume 0bv8 != ~c~1; {865#true} is VALID [2018-11-23 11:26:18,426 INFO L273 TraceCheckUtils]: 4: Hoare triple {865#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {865#true} is VALID [2018-11-23 11:26:18,426 INFO L256 TraceCheckUtils]: 3: Hoare triple {865#true} call #t~ret6 := main(); {865#true} is VALID [2018-11-23 11:26:18,427 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {865#true} {865#true} #82#return; {865#true} is VALID [2018-11-23 11:26:18,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {865#true} assume true; {865#true} is VALID [2018-11-23 11:26:18,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {865#true} call ULTIMATE.init(); {865#true} is VALID [2018-11-23 11:26:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 11:26:18,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:26:18,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-11-23 11:26:18,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 11:26:18,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:18,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:26:18,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:18,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:26:18,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:26:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:26:18,518 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2018-11-23 11:26:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:18,879 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:26:18,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:26:18,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 11:26:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:26:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-23 11:26:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:26:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-23 11:26:18,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 18 transitions. [2018-11-23 11:26:18,918 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:26:18,919 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:26:18,919 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:26:18,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:26:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:26:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:26:18,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:18,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:18,920 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:18,920 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:18,920 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:18,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:18,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:18,921 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:18,921 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:18,922 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:18,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:18,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:18,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:18,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:26:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:26:18,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-23 11:26:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:18,923 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:26:18,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:26:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:18,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:18,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:26:19,269 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:26:19,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:19,270 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-23 11:26:19,270 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 11:26:19,270 INFO L448 ceAbstractionStarter]: For program point L17(lines 11 33) no Hoare annotation was computed. [2018-11-23 11:26:19,270 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. [2018-11-23 11:26:19,270 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 33) no Hoare annotation was computed. [2018-11-23 11:26:19,271 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 11 33) the Hoare annotation is: true [2018-11-23 11:26:19,271 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 31) no Hoare annotation was computed. [2018-11-23 11:26:19,271 INFO L451 ceAbstractionStarter]: At program point L24-2(lines 22 32) the Hoare annotation is: true [2018-11-23 11:26:19,271 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-23 11:26:19,271 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 11 33) no Hoare annotation was computed. [2018-11-23 11:26:19,272 INFO L444 ceAbstractionStarter]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse0 (bvsle f_~k~0 (_ bv1073741823 32)))) (or (and .cse0 (= (bvadd f_~z~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((f_~k~0 (_ BitVec 32))) (and (not (bvslt f_~z~0 f_~k~0)) (bvsle f_~k~0 (_ bv1073741823 32)) (bvslt (_ bv1 32) f_~k~0))) (bvslt (_ bv1 32) f_~k~0)))) [2018-11-23 11:26:19,272 INFO L444 ceAbstractionStarter]: At program point L16-3(line 16) the Hoare annotation is: (bvsge f_~z~0 (_ bv1 32)) [2018-11-23 11:26:19,272 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:19,272 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:26:19,272 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:26:19,273 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:26:19,273 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 34 42) the Hoare annotation is: true [2018-11-23 11:26:19,273 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 34 42) no Hoare annotation was computed. [2018-11-23 11:26:19,273 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 34 42) no Hoare annotation was computed. [2018-11-23 11:26:19,273 INFO L451 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: true [2018-11-23 11:26:19,273 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 36 40) no Hoare annotation was computed. [2018-11-23 11:26:19,274 INFO L451 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: true [2018-11-23 11:26:19,274 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-23 11:26:19,274 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:26:19,274 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:26:19,274 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:26:19,274 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:26:19,275 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:26:19,275 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:26:19,277 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:26:19,277 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:26:19,277 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 11:26:19,278 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:19,278 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:26:19,278 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:26:19,278 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:26:19,278 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:19,278 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 11:26:19,279 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 11:26:19,279 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:19,279 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:19,279 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 11:26:19,321 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:19,322 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-23 11:26:19,322 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-23 11:26:19,322 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:19,322 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:19,322 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:26:19,322 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 11:26:19,323 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 11:26:19,323 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:26:19,323 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-23 11:26:19,323 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:26:19,323 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:26:19,323 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:26:19,323 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 11:26:19,324 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:26:19,325 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:26:19,325 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:26:19,325 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 11:26:19,325 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:26:19,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:26:19 BoogieIcfgContainer [2018-11-23 11:26:19,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:26:19,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:26:19,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:26:19,342 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:26:19,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:11" (3/4) ... [2018-11-23 11:26:19,347 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:26:19,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:26:19,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-23 11:26:19,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:26:19,354 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:26:19,359 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 11:26:19,360 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:26:19,360 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:26:19,389 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~bvsle32(k, 1073741823bv32) && ~bvadd64(z, 4294967295bv32) == 0bv32) || ((~bvsle32(k, 1073741823bv32) && (\exists f_~k~0 : bv32 :: (!~bvslt32(z, f_~k~0) && ~bvsle32(f_~k~0, 1073741823bv32)) && ~bvslt32(1bv32, f_~k~0))) && ~bvslt32(1bv32, k)) [2018-11-23 11:26:19,417 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/trex01_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:26:19,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:26:19,418 INFO L168 Benchmark]: Toolchain (without parser) took 9345.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -247.0 MB). Peak memory consumption was 482.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:19,420 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:19,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.00 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:26:19,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.15 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:26:19,422 INFO L168 Benchmark]: Boogie Preprocessor took 41.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:19,422 INFO L168 Benchmark]: RCFGBuilder took 717.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:19,423 INFO L168 Benchmark]: TraceAbstraction took 8122.27 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 496.1 MB). Peak memory consumption was 496.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:19,424 INFO L168 Benchmark]: Witness Printer took 75.08 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:19,428 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 363.00 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 21.15 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 41.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 717.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8122.27 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 496.1 MB). Peak memory consumption was 496.1 MB. Max. memory is 7.1 GB. * Witness Printer took 75.08 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2018-11-23 11:26:19,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] [2018-11-23 11:26:19,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_~k~0,QUANTIFIED] Derived loop invariant: (~bvsle32(k, 1073741823bv32) && ~bvadd64(z, 4294967295bv32) == 0bv32) || ((~bvsle32(k, 1073741823bv32) && (\exists f_~k~0 : bv32 :: (!~bvslt32(z, f_~k~0) && ~bvsle32(f_~k~0, 1073741823bv32)) && ~bvslt32(1bv32, f_~k~0))) && ~bvslt32(1bv32, k)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. SAFE Result, 7.9s OverallTime, 5 OverallIterations, 10 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 32 SDslu, 339 SDs, 0 SdLazy, 173 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 25 PreInvPairs, 65 NumberOfFragments, 41 HoareAnnotationTreeSize, 25 FomulaSimplifications, 838 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 39 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 85 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 134 ConstructedInterpolants, 15 QuantifiedInterpolants, 9898 SizeOfPredicates, 13 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 100/132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...