java -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.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:39:46,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:39:46,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:39:47,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:39:47,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:39:47,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:39:47,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:39:47,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:39:47,009 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:39:47,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:39:47,011 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:39:47,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:39:47,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:39:47,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:39:47,015 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:39:47,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:39:47,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:39:47,018 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:39:47,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:39:47,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:39:47,023 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:39:47,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:39:47,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:39:47,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:39:47,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:39:47,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:39:47,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:39:47,031 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:39:47,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:39:47,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:39:47,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:39:47,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:39:47,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:39:47,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:39:47,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:39:47,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:39:47,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:39:47,066 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:39:47,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:39:47,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:39:47,068 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:39:47,068 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:39:47,068 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:39:47,069 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:39:47,069 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:39:47,069 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:39:47,069 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:39:47,069 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:39:47,070 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:39:47,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:39:47,071 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:39:47,071 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:39:47,073 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:39:47,073 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:39:47,073 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:39:47,074 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:39:47,074 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:39:47,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:39:47,074 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:39:47,074 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:39:47,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:39:47,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:39:47,075 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:39:47,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:39:47,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:39:47,076 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:39:47,076 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:39:47,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:39:47,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:39:47,077 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:39:47,077 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:39:47,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:39:47,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:39:47,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:39:47,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:39:47,151 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:39:47,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-07 16:39:47,213 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140473e1a/413dbdb380574b4f8d5aa7fb5d3d93c0/FLAGd74030078 [2018-11-07 16:39:47,666 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:39:47,667 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-07 16:39:47,674 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140473e1a/413dbdb380574b4f8d5aa7fb5d3d93c0/FLAGd74030078 [2018-11-07 16:39:47,690 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140473e1a/413dbdb380574b4f8d5aa7fb5d3d93c0 [2018-11-07 16:39:47,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:39:47,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:39:47,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:39:47,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:39:47,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:39:47,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb2eef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47, skipping insertion in model container [2018-11-07 16:39:47,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:39:47,745 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:39:47,980 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:39:47,984 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:39:48,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:39:48,029 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:39:48,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48 WrapperNode [2018-11-07 16:39:48,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:39:48,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:39:48,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:39:48,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:39:48,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:39:48,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:39:48,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:39:48,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:39:48,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (1/1) ... [2018-11-07 16:39:48,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:39:48,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:39:48,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:39:48,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:39:48,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (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-07 16:39:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:39:48,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:39:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:39:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:39:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:39:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:39:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:39:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:39:48,664 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:39:48,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:39:48 BoogieIcfgContainer [2018-11-07 16:39:48,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:39:48,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:39:48,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:39:48,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:39:48,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:39:47" (1/3) ... [2018-11-07 16:39:48,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed07185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:39:48, skipping insertion in model container [2018-11-07 16:39:48,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:48" (2/3) ... [2018-11-07 16:39:48,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed07185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:39:48, skipping insertion in model container [2018-11-07 16:39:48,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:39:48" (3/3) ... [2018-11-07 16:39:48,677 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-07 16:39:48,689 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:39:48,702 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:39:48,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:39:48,765 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:39:48,766 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:39:48,766 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:39:48,766 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:39:48,766 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:39:48,766 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:39:48,766 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:39:48,767 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:39:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-07 16:39:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:39:48,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:48,800 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:48,807 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:48,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-07 16:39:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:48,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:48,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:48,947 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-07 16:39:48,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:39:48,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:39:48,950 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:48,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:39:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:39:48,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:39:48,970 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-07 16:39:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:48,995 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-07 16:39:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:39:48,996 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:39:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:49,008 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:39:49,009 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:39:49,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-07 16:39:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:39:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 16:39:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 16:39:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-07 16:39:49,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-07 16:39:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:49,054 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-07 16:39:49,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:39:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-07 16:39:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:39:49,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:49,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:49,056 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:49,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:49,057 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-07 16:39:49,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:49,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:49,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:49,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:49,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:49,249 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-07 16:39:49,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:39:49,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:39:49,250 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:49,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:39:49,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:39:49,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:39:49,253 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-07 16:39:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:49,564 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-07 16:39:49,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:39:49,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:39:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:49,567 INFO L225 Difference]: With dead ends: 30 [2018-11-07 16:39:49,567 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 16:39:49,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:39:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 16:39:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-07 16:39:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 16:39:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-07 16:39:49,576 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-07 16:39:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:49,577 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-07 16:39:49,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:39:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-07 16:39:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:39:49,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:49,578 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:49,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:49,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-07 16:39:49,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:49,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:49,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:49,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:39:49,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:39:49,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:49,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:39:49,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:39:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:39:49,747 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-07 16:39:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:50,059 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-07 16:39:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:39:50,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-07 16:39:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:50,063 INFO L225 Difference]: With dead ends: 54 [2018-11-07 16:39:50,063 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:39:50,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07 16:39:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:39:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 16:39:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:39:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-07 16:39:50,072 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-07 16:39:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:50,073 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-07 16:39:50,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:39:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-07 16:39:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:39:50,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:50,074 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:50,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:50,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-07 16:39:50,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:50,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:50,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:50,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:50,674 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:50,675 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 16:39:50,677 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:39:50,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:39:50,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:39:50,820 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:39:51,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:39:51,676 INFO L272 AbstractInterpreter]: Visited 22 different actions 116 times. Merged at 13 different actions 76 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 16:39:51,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:51,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:39:51,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:51,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:39:51,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:51,741 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:39:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:51,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:51,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:54,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:39:54,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:39:54,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:39:54,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:39:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:39:54,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:39:54,521 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-11-07 16:39:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:54,993 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-07 16:39:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:39:54,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-07 16:39:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:54,997 INFO L225 Difference]: With dead ends: 54 [2018-11-07 16:39:54,998 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 16:39:54,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:39:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 16:39:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 16:39:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:39:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-07 16:39:55,007 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-11-07 16:39:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:55,007 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-07 16:39:55,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:39:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-07 16:39:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:39:55,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:55,009 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:55,009 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:55,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-11-07 16:39:55,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:55,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:55,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:55,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:55,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:57,200 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-11-07 16:39:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:57,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:39:57,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:39:57,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:57,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:39:57,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:39:57,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:39:57,204 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-07 16:39:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:57,363 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-07 16:39:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:39:57,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-07 16:39:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:57,366 INFO L225 Difference]: With dead ends: 66 [2018-11-07 16:39:57,366 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 16:39:57,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:39:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 16:39:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 16:39:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:39:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-07 16:39:57,381 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-11-07 16:39:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:57,381 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-07 16:39:57,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:39:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-07 16:39:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:39:57,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:57,384 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:57,384 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:57,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-07 16:39:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:57,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:57,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:59,797 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-07 16:40:01,831 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 16:40:03,874 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 16:40:05,892 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 16:40:07,912 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 16:40:10,144 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 20 [2018-11-07 16:40:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-07 16:40:10,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:10,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:10,171 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 16:40:10,172 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [25], [31], [37], [43], [49], [55], [61], [67], [73], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:40:10,174 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:40:10,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:40:10,179 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:40:10,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:40:10,468 INFO L272 AbstractInterpreter]: Visited 22 different actions 25 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-07 16:40:10,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:10,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:40:10,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:10,509 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:10,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:10,527 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:10,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:11,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:11,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:11,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 21 [2018-11-07 16:40:11,390 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:11,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:40:11,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:40:11,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=205, Unknown=6, NotChecked=160, Total=420 [2018-11-07 16:40:11,391 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 17 states. [2018-11-07 16:40:13,615 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-07 16:40:15,661 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 16:40:17,694 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 16:40:19,720 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-11-07 16:40:21,736 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 16:40:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:23,911 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-07 16:40:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:40:23,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-07 16:40:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:23,912 INFO L225 Difference]: With dead ends: 67 [2018-11-07 16:40:23,912 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 16:40:23,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=63, Invalid=234, Unknown=11, NotChecked=342, Total=650 [2018-11-07 16:40:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 16:40:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 16:40:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:40:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 16:40:23,918 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-11-07 16:40:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:23,919 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 16:40:23,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:40:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 16:40:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 16:40:23,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:23,920 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:23,921 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:23,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-11-07 16:40:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:23,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:24,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:24,443 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:24,443 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:24,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:24,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:24,443 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:24,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:24,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:24,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:40:24,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:24,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:24,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:28,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:28,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 16:40:28,284 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:28,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:40:28,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:40:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:40:28,286 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-11-07 16:40:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:28,928 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-07 16:40:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:40:28,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-11-07 16:40:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:28,930 INFO L225 Difference]: With dead ends: 54 [2018-11-07 16:40:28,930 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 16:40:28,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:40:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 16:40:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 16:40:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:40:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 16:40:28,938 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-11-07 16:40:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:28,938 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 16:40:28,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:40:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 16:40:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 16:40:28,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:28,940 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:28,940 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:28,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-11-07 16:40:28,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:28,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:28,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:28,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:28,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:29,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:29,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:29,766 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:29,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:29,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:29,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:29,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:29,776 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:29,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:29,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:29,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:29,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:34,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:34,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 16:40:34,371 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:34,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 16:40:34,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 16:40:34,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:40:34,380 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-11-07 16:40:35,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:35,220 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 16:40:35,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:40:35,225 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-07 16:40:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:35,226 INFO L225 Difference]: With dead ends: 66 [2018-11-07 16:40:35,226 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 16:40:35,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:40:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 16:40:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 16:40:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 16:40:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 16:40:35,237 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-11-07 16:40:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:35,237 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 16:40:35,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 16:40:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 16:40:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 16:40:35,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:35,239 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:35,240 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:35,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-11-07 16:40:35,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:35,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:35,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:35,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:35,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:36,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:36,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:36,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:36,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:36,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:36,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:36,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:36,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:36,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:36,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 16:40:41,321 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:41,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:40:41,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:40:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:40:41,325 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-11-07 16:40:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:43,124 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 16:40:43,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:40:43,125 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-11-07 16:40:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:43,127 INFO L225 Difference]: With dead ends: 78 [2018-11-07 16:40:43,127 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 16:40:43,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:40:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 16:40:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 16:40:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 16:40:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 16:40:43,136 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-11-07 16:40:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:43,136 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 16:40:43,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:40:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 16:40:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 16:40:43,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:43,138 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:43,138 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:43,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-11-07 16:40:43,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:43,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:43,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:45,625 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:40:47,906 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:40:50,038 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:40:52,209 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:40:54,293 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:40:56,380 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:40:58,464 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:00,633 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:02,728 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:06,927 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:09,110 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:11,556 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:15,903 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:20,055 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:22,463 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:26,622 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:30,898 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:37,071 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:39,344 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:41,493 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:45,658 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:47,959 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:50,898 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:55,069 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:57,407 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:41:59,576 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:42:01,746 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 16:42:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:02,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:02,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:42:02,047 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:42:02,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:42:02,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:02,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:42:02,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:42:02,059 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:42:02,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:42:02,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:42:02,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:42:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:07,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:42:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:42:17,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:42:17,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 108 [2018-11-07 16:42:17,689 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:42:17,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-07 16:42:17,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-07 16:42:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=11142, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 16:42:17,692 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 104 states. [2018-11-07 16:42:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:20,038 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-11-07 16:42:20,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 16:42:20,039 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 71 [2018-11-07 16:42:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:20,039 INFO L225 Difference]: With dead ends: 87 [2018-11-07 16:42:20,040 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:42:20,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 38 SyntacticMatches, 53 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 94.1s TimeCoverageRelationStatistics Valid=420, Invalid=11352, Unknown=0, NotChecked=0, Total=11772 [2018-11-07 16:42:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:42:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:42:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:42:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:42:20,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-11-07 16:42:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:20,045 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:42:20,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-07 16:42:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:42:20,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:42:20,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:42:20,732 WARN L179 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-07 16:42:20,758 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 16:42:20,758 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:42:20,758 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:42:20,758 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:42:20,759 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:42:20,759 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:42:20,759 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse1 (+ .cse3 main_~x~0 .cse4)) (.cse0 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-11-07 16:42:20,759 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,759 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-07 16:42:20,759 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,759 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,759 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-07 16:42:20,760 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-07 16:42:20,761 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-07 16:42:20,761 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 16:42:20,761 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 16:42:20,761 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:42:20,761 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 16:42:20,761 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 16:42:20,761 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:42:20,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:42:20 BoogieIcfgContainer [2018-11-07 16:42:20,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:42:20,778 INFO L168 Benchmark]: Toolchain (without parser) took 153075.72 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 886.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -101.6 MB). Peak memory consumption was 784.5 MB. Max. memory is 7.1 GB. [2018-11-07 16:42:20,779 INFO L168 Benchmark]: CDTParser took 0.26 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-07 16:42:20,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.42 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-07 16:42:20,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.43 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-07 16:42:20,781 INFO L168 Benchmark]: Boogie Preprocessor took 33.51 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-07 16:42:20,781 INFO L168 Benchmark]: RCFGBuilder took 562.51 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 669.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -713.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:42:20,782 INFO L168 Benchmark]: TraceAbstraction took 152109.61 ms. Allocated memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: 216.5 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 601.6 MB). Peak memory consumption was 818.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:42:20,787 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.42 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 37.43 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 33.51 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 562.51 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 669.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -713.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 152109.61 ms. Allocated memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: 216.5 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 601.6 MB). Peak memory consumption was 818.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: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 152.0s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 27 SDslu, 1974 SDs, 0 SdLazy, 7229 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 717 GetRequests, 309 SyntacticMatches, 66 SemanticMatches, 342 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2551 ImplicationChecksByTransitivity, 140.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 129.2s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 819 ConstructedInterpolants, 63 QuantifiedInterpolants, 490749 SizeOfPredicates, 10 NumberOfNonLiveVariables, 812 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 124/820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...