java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:38:06,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:38:06,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:38:06,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:38:06,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:38:06,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:38:06,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:38:06,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:38:06,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:38:06,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:38:06,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:38:06,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:38:06,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:38:06,031 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:38:06,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:38:06,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:38:06,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:38:06,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:38:06,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:38:06,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:38:06,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:38:06,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:38:06,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:38:06,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:38:06,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:38:06,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:38:06,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:38:06,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:38:06,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:38:06,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:38:06,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:38:06,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:38:06,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:38:06,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:38:06,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:38:06,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:38:06,073 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:38:06,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:38:06,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:38:06,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:38:06,100 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:38:06,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:38:06,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:38:06,101 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:38:06,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:38:06,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:38:06,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:38:06,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:38:06,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:38:06,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:38:06,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:38:06,102 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:38:06,103 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:38:06,103 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:38:06,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:38:06,103 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:38:06,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:38:06,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:38:06,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:38:06,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:38:06,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:38:06,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:06,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:38:06,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:38:06,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:38:06,105 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:38:06,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:38:06,106 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:38:06,106 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:38:06,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:38:06,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:38:06,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:38:06,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:38:06,168 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:38:06,168 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:38:06,169 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-23 11:38:06,234 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48487c89d/35d2d7e7c21d44bb9eb3a253426213f1/FLAGfae10e169 [2018-11-23 11:38:06,721 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:38:06,721 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-23 11:38:06,728 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48487c89d/35d2d7e7c21d44bb9eb3a253426213f1/FLAGfae10e169 [2018-11-23 11:38:07,081 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48487c89d/35d2d7e7c21d44bb9eb3a253426213f1 [2018-11-23 11:38:07,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:38:07,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:38:07,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:07,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:38:07,100 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:38:07,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44aa645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07, skipping insertion in model container [2018-11-23 11:38:07,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:38:07,142 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:38:07,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:07,355 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:38:07,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:07,392 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:38:07,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07 WrapperNode [2018-11-23 11:38:07,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:07,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:07,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:38:07,394 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:38:07,405 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:38:07" (1/1) ... [2018-11-23 11:38:07,412 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:38:07" (1/1) ... [2018-11-23 11:38:07,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:07,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:38:07,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:38:07,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:38:07,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (1/1) ... [2018-11-23 11:38:07,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:38:07,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:38:07,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:38:07,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:38:07,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (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:38:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:38:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:38:07,979 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:07,980 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:38:07,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:07 BoogieIcfgContainer [2018-11-23 11:38:07,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:07,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:07,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:07,988 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:07,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:38:07" (1/3) ... [2018-11-23 11:38:07,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f8d619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:07, skipping insertion in model container [2018-11-23 11:38:07,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:07" (2/3) ... [2018-11-23 11:38:07,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f8d619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:07, skipping insertion in model container [2018-11-23 11:38:07,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:07" (3/3) ... [2018-11-23 11:38:07,993 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005_true-unreach-call_true-termination.c.i [2018-11-23 11:38:08,002 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:08,010 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:08,028 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:08,064 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:08,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:08,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:08,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:08,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:08,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:08,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:08,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:08,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 11:38:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:38:08,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:08,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:08,100 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:08,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash -14991171, now seen corresponding path program 1 times [2018-11-23 11:38:08,116 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:08,117 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:38:08,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:08,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:08,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 11:38:08,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 11:38:08,336 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-23 11:38:08,337 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 11:38:08,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {38#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:08,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsge32(~j~0, ~i~0); {22#false} is VALID [2018-11-23 11:38:08,342 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 6bv32 == ~j~0 then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-23 11:38:08,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 11:38:08,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0bv32 == ~cond; {22#false} is VALID [2018-11-23 11:38:08,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 11:38:08,346 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:38:08,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:08,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:38:08,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:38:08,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:08,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:38:08,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:08,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:38:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:38:08,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:38:08,414 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-23 11:38:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:08,654 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:38:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:38:08,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:38:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:38:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 11:38:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:38:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 11:38:08,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 11:38:08,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:08,833 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:38:08,834 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:38:08,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:38:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:38:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:38:09,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:09,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:09,001 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:09,002 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:09,005 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:38:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:38:09,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:09,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:09,005 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:09,006 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:09,009 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:38:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:38:09,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:09,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:09,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:09,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:38:09,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:38:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:09,014 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:38:09,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:38:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:38:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:38:09,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:09,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:09,016 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:09,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:09,016 INFO L82 PathProgramCache]: Analyzing trace with hash -429188558, now seen corresponding path program 1 times [2018-11-23 11:38:09,017 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:09,017 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:38:09,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:09,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:09,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-23 11:38:09,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-23 11:38:09,293 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #32#return; {138#true} is VALID [2018-11-23 11:38:09,293 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret1 := main(); {138#true} is VALID [2018-11-23 11:38:09,294 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {155#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:09,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {159#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:09,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {159#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvsge32(~j~0, ~i~0); {139#false} is VALID [2018-11-23 11:38:09,296 INFO L256 TraceCheckUtils]: 7: Hoare triple {139#false} call __VERIFIER_assert((if 6bv32 == ~j~0 then 1bv32 else 0bv32)); {139#false} is VALID [2018-11-23 11:38:09,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {139#false} ~cond := #in~cond; {139#false} is VALID [2018-11-23 11:38:09,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {139#false} assume 0bv32 == ~cond; {139#false} is VALID [2018-11-23 11:38:09,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-23 11:38:09,300 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:38:09,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:09,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-23 11:38:09,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {139#false} assume 0bv32 == ~cond; {139#false} is VALID [2018-11-23 11:38:09,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {139#false} ~cond := #in~cond; {139#false} is VALID [2018-11-23 11:38:09,468 INFO L256 TraceCheckUtils]: 7: Hoare triple {139#false} call __VERIFIER_assert((if 6bv32 == ~j~0 then 1bv32 else 0bv32)); {139#false} is VALID [2018-11-23 11:38:09,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {187#(bvsge main_~j~0 main_~i~0)} assume !~bvsge32(~j~0, ~i~0); {139#false} is VALID [2018-11-23 11:38:09,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {187#(bvsge main_~j~0 main_~i~0)} is VALID [2018-11-23 11:38:09,473 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {191#(bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:09,473 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret1 := main(); {138#true} is VALID [2018-11-23 11:38:09,474 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #32#return; {138#true} is VALID [2018-11-23 11:38:09,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-23 11:38:09,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-23 11:38:09,476 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:38:09,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:09,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:38:09,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:38:09,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:09,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:38:09,528 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:38:09,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:38:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:38:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:38:09,530 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:38:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,189 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:38:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:38:10,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:38:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:38:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:38:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:38:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:38:10,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2018-11-23 11:38:10,271 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:38:10,273 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:38:10,273 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:38:10,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:38:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:38:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:38:10,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:10,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:10,299 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:10,299 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,301 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:38:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:38:10,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:10,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:10,302 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:10,302 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,304 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:38:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:38:10,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:10,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:10,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:10,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:38:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:38:10,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:38:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:10,307 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:38:10,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:38:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:38:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:38:10,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:10,308 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:10,308 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:10,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1090549245, now seen corresponding path program 2 times [2018-11-23 11:38:10,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:10,310 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:38:10,331 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:10,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:10,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:10,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:10,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {300#true} is VALID [2018-11-23 11:38:10,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2018-11-23 11:38:10,672 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #32#return; {300#true} is VALID [2018-11-23 11:38:10,672 INFO L256 TraceCheckUtils]: 3: Hoare triple {300#true} call #t~ret1 := main(); {300#true} is VALID [2018-11-23 11:38:10,673 INFO L273 TraceCheckUtils]: 4: Hoare triple {300#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {317#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {321#(= (_ bv9 32) main_~j~0)} is VALID [2018-11-23 11:38:10,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {321#(= (_ bv9 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {325#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {329#(= (_ bv7 32) main_~j~0)} is VALID [2018-11-23 11:38:10,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {329#(= (_ bv7 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} assume !~bvsge32(~j~0, ~i~0); {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,681 INFO L256 TraceCheckUtils]: 10: Hoare triple {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} call __VERIFIER_assert((if 6bv32 == ~j~0 then 1bv32 else 0bv32)); {340#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {340#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {344#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {344#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {301#false} is VALID [2018-11-23 11:38:10,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {301#false} assume !false; {301#false} is VALID [2018-11-23 11:38:10,685 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:38:10,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:10,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {301#false} assume !false; {301#false} is VALID [2018-11-23 11:38:10,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {354#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {301#false} is VALID [2018-11-23 11:38:10,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {354#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:10,861 INFO L256 TraceCheckUtils]: 10: Hoare triple {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} call __VERIFIER_assert((if 6bv32 == ~j~0 then 1bv32 else 0bv32)); {358#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:10,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} assume !~bvsge32(~j~0, ~i~0); {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {329#(= (_ bv7 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {333#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {329#(= (_ bv7 32) main_~j~0)} is VALID [2018-11-23 11:38:10,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {321#(= (_ bv9 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {325#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {321#(= (_ bv9 32) main_~j~0)} is VALID [2018-11-23 11:38:10,870 INFO L273 TraceCheckUtils]: 4: Hoare triple {300#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {317#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:10,870 INFO L256 TraceCheckUtils]: 3: Hoare triple {300#true} call #t~ret1 := main(); {300#true} is VALID [2018-11-23 11:38:10,870 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #32#return; {300#true} is VALID [2018-11-23 11:38:10,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2018-11-23 11:38:10,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {300#true} is VALID [2018-11-23 11:38:10,872 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:38:10,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:10,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-23 11:38:10,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-11-23 11:38:10,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:10,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:38:10,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:10,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:38:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:38:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:38:10,919 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 11 states. [2018-11-23 11:38:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:11,450 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:38:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:11,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-11-23 11:38:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 11:38:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 11:38:11,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2018-11-23 11:38:11,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:11,490 INFO L225 Difference]: With dead ends: 21 [2018-11-23 11:38:11,490 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:38:11,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:38:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 11:38:11,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:11,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:11,511 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:11,511 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:11,514 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:38:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:38:11,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:11,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:11,515 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:11,515 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:11,516 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:38:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:38:11,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:11,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:11,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:11,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 11:38:11,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 11:38:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:11,520 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 11:38:11,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:38:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:38:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:38:11,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:11,521 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:11,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:11,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash -517174030, now seen corresponding path program 3 times [2018-11-23 11:38:11,522 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:11,522 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:38:11,544 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:38:11,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:38:11,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:11,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:11,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2018-11-23 11:38:11,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-23 11:38:11,836 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {491#true} {491#true} #32#return; {491#true} is VALID [2018-11-23 11:38:11,837 INFO L256 TraceCheckUtils]: 3: Hoare triple {491#true} call #t~ret1 := main(); {491#true} is VALID [2018-11-23 11:38:11,839 INFO L273 TraceCheckUtils]: 4: Hoare triple {491#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {508#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:11,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {508#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {512#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0))} is VALID [2018-11-23 11:38:11,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {512#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {516#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:11,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {516#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {520#(and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:11,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {520#(and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {524#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:11,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {524#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {492#false} is VALID [2018-11-23 11:38:11,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {492#false} assume !~bvsge32(~j~0, ~i~0); {492#false} is VALID [2018-11-23 11:38:11,845 INFO L256 TraceCheckUtils]: 11: Hoare triple {492#false} call __VERIFIER_assert((if 6bv32 == ~j~0 then 1bv32 else 0bv32)); {492#false} is VALID [2018-11-23 11:38:11,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2018-11-23 11:38:11,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {492#false} assume 0bv32 == ~cond; {492#false} is VALID [2018-11-23 11:38:11,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {492#false} assume !false; {492#false} is VALID [2018-11-23 11:38:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:11,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:16,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {492#false} assume !false; {492#false} is VALID [2018-11-23 11:38:16,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {492#false} assume 0bv32 == ~cond; {492#false} is VALID [2018-11-23 11:38:16,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2018-11-23 11:38:16,247 INFO L256 TraceCheckUtils]: 11: Hoare triple {492#false} call __VERIFIER_assert((if 6bv32 == ~j~0 then 1bv32 else 0bv32)); {492#false} is VALID [2018-11-23 11:38:16,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {492#false} assume !~bvsge32(~j~0, ~i~0); {492#false} is VALID [2018-11-23 11:38:16,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#(not (bvsge main_~j~0 main_~i~0))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {492#false} is VALID [2018-11-23 11:38:16,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {562#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge main_~j~0 main_~i~0)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {558#(not (bvsge main_~j~0 main_~i~0))} is VALID [2018-11-23 11:38:16,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {566#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {562#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:38:16,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {570#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {566#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} is VALID [2018-11-23 11:38:17,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {574#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967292 32)) (bvadd main_~i~0 (_ bv8 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {570#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} is VALID [2018-11-23 11:38:17,323 INFO L273 TraceCheckUtils]: 4: Hoare triple {491#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {574#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967292 32)) (bvadd main_~i~0 (_ bv8 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))))} is VALID [2018-11-23 11:38:17,323 INFO L256 TraceCheckUtils]: 3: Hoare triple {491#true} call #t~ret1 := main(); {491#true} is VALID [2018-11-23 11:38:17,324 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {491#true} {491#true} #32#return; {491#true} is VALID [2018-11-23 11:38:17,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {491#true} assume true; {491#true} is VALID [2018-11-23 11:38:17,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2018-11-23 11:38:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:17,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:17,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:38:17,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-11-23 11:38:17,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:17,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:18,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:18,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:18,508 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2018-11-23 11:38:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,802 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:38:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:38:18,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-11-23 11:38:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-23 11:38:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-23 11:38:18,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2018-11-23 11:38:18,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:18,850 INFO L225 Difference]: With dead ends: 16 [2018-11-23 11:38:18,850 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:38:18,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:38:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:38:18,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:18,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:18,852 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:18,852 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,852 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:38:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:38:18,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:18,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:18,853 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:18,853 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:18,853 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:38:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:38:18,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:18,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:18,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:18,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:38:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:38:18,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-23 11:38:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:18,855 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:38:18,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:38:18,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:18,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:38:19,227 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:38:19,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:38:19,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:38:19,228 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:38:19,228 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:38:19,228 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:38:19,228 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 20) the Hoare annotation is: true [2018-11-23 11:38:19,228 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 20) no Hoare annotation was computed. [2018-11-23 11:38:19,228 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-23 11:38:19,229 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 20) no Hoare annotation was computed. [2018-11-23 11:38:19,229 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 17) the Hoare annotation is: (or (and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0)) (and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))) (and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))) [2018-11-23 11:38:19,229 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 17) the Hoare annotation is: (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) [2018-11-23 11:38:19,229 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:38:19,230 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:38:19,230 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:38:19,230 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:38:19,230 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:38:19,230 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:38:19,232 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:38:19,233 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:38:19,233 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:38:19,233 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:38:19,244 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:38:19,245 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:38:19,246 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:38:19,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:38:19 BoogieIcfgContainer [2018-11-23 11:38:19,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:38:19,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:38:19,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:38:19,259 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:38:19,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:07" (3/4) ... [2018-11-23 11:38:19,264 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:38:19,272 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:38:19,272 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:38:19,273 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:38:19,280 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:38:19,281 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:38:19,281 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:38:19,323 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 11:38:19,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:38:19,325 INFO L168 Benchmark]: Toolchain (without parser) took 12231.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -497.0 MB). Peak memory consumption was 241.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:38:19,327 INFO L168 Benchmark]: CDTParser took 0.23 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:38:19,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.66 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:38:19,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.46 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:38:19,329 INFO L168 Benchmark]: Boogie Preprocessor took 35.03 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:38:19,329 INFO L168 Benchmark]: RCFGBuilder took 524.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:38:19,330 INFO L168 Benchmark]: TraceAbstraction took 11277.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.3 MB). Peak memory consumption was 268.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:38:19,331 INFO L168 Benchmark]: Witness Printer took 64.39 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:38:19,336 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.23 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 297.66 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 26.46 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 35.03 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 524.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11277.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.3 MB). Peak memory consumption was 268.3 MB. Max. memory is 7.1 GB. * Witness Printer took 64.39 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * 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: 14]: Loop Invariant Derived loop invariant: ((((~bvadd64(i, 4294967293bv32) == 0bv32 && 9bv32 == j) || (7bv32 == j && ~bvadd64(i, 4294967289bv32) == 0bv32)) || (~bvadd64(j, 4294967286bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32)) || (~bvadd64(j, 4294967288bv32) == 0bv32 && ~bvadd64(i, 4294967291bv32) == 0bv32)) || (~bvadd64(i, 4294967287bv32) == 0bv32 && ~bvadd64(j, 4294967290bv32) == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 11.1s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 1 SDslu, 123 SDs, 0 SdLazy, 105 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 16 NumberOfFragments, 62 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 3609 SizeOfPredicates, 6 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 11/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...