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-EXP.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:32:59,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:32:59,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:32:59,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:32:59,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:32:59,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:32:59,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:32:59,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:32:59,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:32:59,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:32:59,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:32:59,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:32:59,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:32:59,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:32:59,524 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:32:59,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:32:59,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:32:59,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:32:59,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:32:59,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:32:59,533 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:32:59,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:32:59,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:32:59,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:32:59,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:32:59,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:32:59,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:32:59,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:32:59,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:32:59,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:32:59,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:32:59,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:32:59,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:32:59,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:32:59,554 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:32:59,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:32:59,555 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:32:59,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:32:59,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:32:59,577 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:32:59,577 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:32:59,577 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:32:59,578 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:32:59,578 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:32:59,578 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:32:59,578 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:32:59,578 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:32:59,579 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:32:59,579 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:32:59,579 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:32:59,579 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:32:59,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:32:59,580 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:32:59,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:32:59,581 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:32:59,581 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:32:59,581 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:32:59,581 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:32:59,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:32:59,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:32:59,582 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:32:59,582 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:32:59,582 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:32:59,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:32:59,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:32:59,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:32:59,586 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:32:59,586 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:32:59,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:32:59,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:32:59,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:32:59,587 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:32:59,587 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:32:59,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:32:59,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:32:59,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:32:59,675 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:32:59,675 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:32:59,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-07 10:32:59,738 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14b4d21e/dc5d0f01eef74f9e8e8ca9bbfcd05888/FLAGf9834299f [2018-11-07 10:33:00,141 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:33:00,141 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-07 10:33:00,150 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14b4d21e/dc5d0f01eef74f9e8e8ca9bbfcd05888/FLAGf9834299f [2018-11-07 10:33:00,166 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14b4d21e/dc5d0f01eef74f9e8e8ca9bbfcd05888 [2018-11-07 10:33:00,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:33:00,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:33:00,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:33:00,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:33:00,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:33:00,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b5474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00, skipping insertion in model container [2018-11-07 10:33:00,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:33:00,221 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:33:00,455 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:33:00,459 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:33:00,481 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:33:00,496 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:33:00,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00 WrapperNode [2018-11-07 10:33:00,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:33:00,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:33:00,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:33:00,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:33:00,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:33:00,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:33:00,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:33:00,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:33:00,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (1/1) ... [2018-11-07 10:33:00,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:33:00,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:33:00,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:33:00,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:33:00,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (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 10:33:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:33:00,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:33:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:33:00,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:33:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:33:00,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:33:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:33:00,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:33:00,902 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:33:00,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:00 BoogieIcfgContainer [2018-11-07 10:33:00,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:33:00,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:33:00,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:33:00,906 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:33:00,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:33:00" (1/3) ... [2018-11-07 10:33:00,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598918ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:00, skipping insertion in model container [2018-11-07 10:33:00,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:00" (2/3) ... [2018-11-07 10:33:00,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598918ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:00, skipping insertion in model container [2018-11-07 10:33:00,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:00" (3/3) ... [2018-11-07 10:33:00,910 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i [2018-11-07 10:33:00,920 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:33:00,928 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:33:00,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:33:00,976 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:33:00,976 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:33:00,977 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:33:00,977 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:33:00,977 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:33:00,977 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:33:00,977 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:33:00,978 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:33:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-07 10:33:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:33:01,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:01,003 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:01,006 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:01,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-07 10:33:01,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:01,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:01,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:01,109 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 10:33:01,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:33:01,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:33:01,111 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:01,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:33:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:33:01,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:33:01,129 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-07 10:33:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:01,151 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 10:33:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:33:01,153 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:33:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:01,160 INFO L225 Difference]: With dead ends: 30 [2018-11-07 10:33:01,160 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 10:33:01,163 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 10:33:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 10:33:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 10:33:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 10:33:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 10:33:01,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 10:33:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:01,201 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 10:33:01,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:33:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 10:33:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:33:01,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:01,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:01,203 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:01,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:01,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-07 10:33:01,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:01,395 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 10:33:01,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:33:01,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:33:01,396 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:01,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:33:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:33:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:33:01,398 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 10:33:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:01,533 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-07 10:33:01,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:33:01,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 10:33:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:01,536 INFO L225 Difference]: With dead ends: 21 [2018-11-07 10:33:01,536 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 10:33:01,537 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 10:33:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 10:33:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-07 10:33:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-07 10:33:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-07 10:33:01,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-07 10:33:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:01,543 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-07 10:33:01,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:33:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-07 10:33:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:33:01,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:01,544 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:01,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:01,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:01,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-07 10:33:01,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:01,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:01,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:01,708 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 10:33:01,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:01,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:01,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 10:33:01,712 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 10:33:01,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:33:01,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:33:01,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:33:01,981 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 3 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 10:33:02,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:02,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:33:02,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:02,035 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 10:33:02,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:02,051 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:02,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:02,142 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 10:33:02,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:02,211 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 10:33:02,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:02,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 10:33:02,232 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:02,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:33:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:33:02,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:02,234 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2018-11-07 10:33:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:02,377 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-07 10:33:02,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:33:02,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 10:33:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:02,379 INFO L225 Difference]: With dead ends: 24 [2018-11-07 10:33:02,379 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 10:33:02,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 10:33:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-07 10:33:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 10:33:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-07 10:33:02,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-07 10:33:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:02,385 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-07 10:33:02,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:33:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-07 10:33:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:33:02,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:02,386 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:02,386 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:02,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash -281914435, now seen corresponding path program 1 times [2018-11-07 10:33:02,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:02,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:02,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:02,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:02,388 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:02,546 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 10:33:02,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:02,547 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:02,547 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 10:33:02,547 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 10:33:02,549 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:33:02,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:33:02,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:33:02,637 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 3 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-07 10:33:02,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:02,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:33:02,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:02,678 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 10:33:02,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:02,696 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:02,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:02,768 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 10:33:02,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:02,994 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 10:33:03,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:03,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 10:33:03,014 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:03,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:33:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:33:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:03,015 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2018-11-07 10:33:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:03,075 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-07 10:33:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:33:03,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 10:33:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:03,076 INFO L225 Difference]: With dead ends: 26 [2018-11-07 10:33:03,076 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 10:33:03,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 10:33:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-07 10:33:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 10:33:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-07 10:33:03,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-07 10:33:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:03,082 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-07 10:33:03,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:33:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-07 10:33:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:33:03,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:03,083 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:03,084 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:03,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-07 10:33:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:03,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:03,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:03,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:03,189 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:03,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:03,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:03,189 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 10:33:03,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:03,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:03,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:33:03,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:03,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:03,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:03,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 10:33:03,377 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:03,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:33:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:33:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:33:03,378 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2018-11-07 10:33:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:03,566 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-07 10:33:03,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:33:03,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 10:33:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:03,567 INFO L225 Difference]: With dead ends: 29 [2018-11-07 10:33:03,567 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 10:33:03,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:33:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 10:33:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-07 10:33:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:33:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-07 10:33:03,573 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2018-11-07 10:33:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:03,573 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-07 10:33:03,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:33:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-07 10:33:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:33:03,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:03,574 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:03,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:03,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash -849134272, now seen corresponding path program 1 times [2018-11-07 10:33:03,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:03,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:03,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:03,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:03,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:03,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:03,689 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:03,689 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 10:33:03,690 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 10:33:03,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:33:03,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:33:03,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:33:03,782 INFO L272 AbstractInterpreter]: Visited 14 different actions 33 times. Merged at 5 different actions 10 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 4 variables. [2018-11-07 10:33:03,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:03,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:33:03,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:03,823 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 10:33:03,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:03,841 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:03,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:04,087 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2018-11-07 10:33:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:04,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:04,197 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:33:04,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-11-07 10:33:04,197 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:33:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:33:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:04,198 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2018-11-07 10:33:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:04,214 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-07 10:33:04,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:33:04,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 10:33:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:04,217 INFO L225 Difference]: With dead ends: 35 [2018-11-07 10:33:04,217 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 10:33:04,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 10:33:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-07 10:33:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 10:33:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-07 10:33:04,224 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-07 10:33:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:04,224 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-07 10:33:04,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:33:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-07 10:33:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:33:04,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:04,226 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:04,226 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:04,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1277798652, now seen corresponding path program 2 times [2018-11-07 10:33:04,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:04,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:04,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:04,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:04,464 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:04,464 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:04,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:04,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:04,464 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 10:33:04,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:04,473 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:04,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:33:04,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:04,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:04,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:04,749 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:33:04,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-11-07 10:33:04,749 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:04,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:33:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:33:04,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:04,751 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-07 10:33:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:04,767 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-07 10:33:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:33:04,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 10:33:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:04,768 INFO L225 Difference]: With dead ends: 35 [2018-11-07 10:33:04,768 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 10:33:04,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:33:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 10:33:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-07 10:33:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 10:33:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-07 10:33:04,774 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-11-07 10:33:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:04,774 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-07 10:33:04,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:33:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-07 10:33:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:33:04,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:04,776 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:04,776 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:04,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:04,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1242161282, now seen corresponding path program 2 times [2018-11-07 10:33:04,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:04,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:04,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:04,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:04,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:04,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:04,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:04,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:04,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:04,907 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 10:33:04,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:04,923 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:16,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:33:16,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:16,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:17,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:17,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:17,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 10:33:17,376 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:17,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:33:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:33:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:33:17,377 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-07 10:33:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:17,419 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-07 10:33:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:33:17,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 10:33:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:17,421 INFO L225 Difference]: With dead ends: 35 [2018-11-07 10:33:17,421 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 10:33:17,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:33:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 10:33:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-07 10:33:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 10:33:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-07 10:33:17,427 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2018-11-07 10:33:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:17,427 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-07 10:33:17,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:33:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-07 10:33:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:33:17,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:17,429 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:17,429 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:17,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:17,429 INFO L82 PathProgramCache]: Analyzing trace with hash 26004059, now seen corresponding path program 3 times [2018-11-07 10:33:17,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:17,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:17,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:17,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:17,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:17,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:17,575 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:17,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:17,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:17,576 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:17,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:17,584 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:17,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:17,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:17,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:17,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:17,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:17,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 10:33:17,728 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:17,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:33:17,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:33:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:33:17,729 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 6 states. [2018-11-07 10:33:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:17,819 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-07 10:33:17,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:33:17,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 10:33:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:17,821 INFO L225 Difference]: With dead ends: 38 [2018-11-07 10:33:17,821 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 10:33:17,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:33:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 10:33:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-07 10:33:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 10:33:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-07 10:33:17,827 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-11-07 10:33:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:17,828 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-07 10:33:17,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:33:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-07 10:33:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:33:17,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:17,829 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:17,829 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:17,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 821178397, now seen corresponding path program 3 times [2018-11-07 10:33:17,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:17,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:17,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:17,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:17,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:18,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:18,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:18,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:18,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:18,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:18,015 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:18,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:18,031 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:18,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:18,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:18,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:18,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:18,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:18,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 10:33:18,175 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:18,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:33:18,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:33:18,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:33:18,177 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 6 states. [2018-11-07 10:33:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:18,240 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-07 10:33:18,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:33:18,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 10:33:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:18,241 INFO L225 Difference]: With dead ends: 41 [2018-11-07 10:33:18,241 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 10:33:18,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:33:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 10:33:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-07 10:33:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 10:33:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-07 10:33:18,248 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 20 [2018-11-07 10:33:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:18,248 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-07 10:33:18,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:33:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-07 10:33:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:33:18,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:18,250 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:18,250 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:18,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash 427509150, now seen corresponding path program 4 times [2018-11-07 10:33:18,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:18,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:18,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:18,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:18,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:18,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:18,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:18,386 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:18,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:18,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:18,386 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:18,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:18,395 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:18,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:18,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:18,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:18,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 10:33:18,696 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:18,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:33:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:33:18,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:33:18,697 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-11-07 10:33:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:18,791 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-07 10:33:18,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:33:18,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-07 10:33:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:18,793 INFO L225 Difference]: With dead ends: 44 [2018-11-07 10:33:18,793 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 10:33:18,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:33:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 10:33:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-07 10:33:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 10:33:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-07 10:33:18,799 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2018-11-07 10:33:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:18,799 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-07 10:33:18,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:33:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-07 10:33:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:33:18,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:18,801 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:18,801 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:18,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 201615134, now seen corresponding path program 4 times [2018-11-07 10:33:18,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:18,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:18,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:19,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:19,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:19,024 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:19,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:19,024 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:19,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:19,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:19,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:19,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:19,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 10:33:19,214 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:19,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:33:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:33:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:33:19,215 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 7 states. [2018-11-07 10:33:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:19,293 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-07 10:33:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:33:19,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-07 10:33:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:19,296 INFO L225 Difference]: With dead ends: 47 [2018-11-07 10:33:19,296 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 10:33:19,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:33:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 10:33:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-07 10:33:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 10:33:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-07 10:33:19,302 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 23 [2018-11-07 10:33:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:19,302 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-07 10:33:19,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:33:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-07 10:33:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:33:19,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:19,303 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:19,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:19,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash 181755771, now seen corresponding path program 5 times [2018-11-07 10:33:19,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:19,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:19,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:19,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:19,305 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:19,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:19,549 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:19,550 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:19,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:19,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:19,550 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:19,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:19,559 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:19,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:33:19,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:19,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:19,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:19,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:19,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 10:33:19,987 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:19,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:33:19,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:33:19,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:33:19,988 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2018-11-07 10:33:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:20,095 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-07 10:33:20,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:33:20,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-07 10:33:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:20,096 INFO L225 Difference]: With dead ends: 50 [2018-11-07 10:33:20,097 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 10:33:20,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:33:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 10:33:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-07 10:33:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 10:33:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-07 10:33:20,104 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2018-11-07 10:33:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:20,105 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-07 10:33:20,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:33:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-07 10:33:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:33:20,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:20,106 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:20,107 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:20,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1733081987, now seen corresponding path program 5 times [2018-11-07 10:33:20,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:20,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:20,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:20,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:20,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:20,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:20,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:20,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:20,325 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:20,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:20,339 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:32,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:33:32,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:32,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:33:33,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:33:35,384 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:33:35,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 18 [2018-11-07 10:33:35,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:33:35,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:33:35,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:33:35,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=246, Unknown=1, NotChecked=0, Total=306 [2018-11-07 10:33:35,386 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 7 states. [2018-11-07 10:33:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:35,535 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-07 10:33:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:33:35,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-07 10:33:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:35,539 INFO L225 Difference]: With dead ends: 49 [2018-11-07 10:33:35,539 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 10:33:35,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=71, Invalid=308, Unknown=1, NotChecked=0, Total=380 [2018-11-07 10:33:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 10:33:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 10:33:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 10:33:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 10:33:35,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-07 10:33:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:35,550 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 10:33:35,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:33:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 10:33:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:33:35,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:35,555 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:35,556 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:35,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1862081662, now seen corresponding path program 6 times [2018-11-07 10:33:35,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:35,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:35,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:35,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:35,725 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:35,725 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:35,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:35,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:35,726 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:35,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:35,734 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:35,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:35,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:35,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:35,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:36,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:36,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 10:33:36,212 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:36,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:33:36,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:33:36,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:33:36,213 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-11-07 10:33:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:36,341 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 10:33:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:33:36,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 10:33:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:36,342 INFO L225 Difference]: With dead ends: 39 [2018-11-07 10:33:36,343 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 10:33:36,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:33:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 10:33:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 10:33:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:33:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-07 10:33:36,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-07 10:33:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:36,349 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-07 10:33:36,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:33:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-07 10:33:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 10:33:36,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:36,350 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:36,351 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:36,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1688101733, now seen corresponding path program 7 times [2018-11-07 10:33:36,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:36,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:36,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:36,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:36,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:36,734 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:36,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:36,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:36,734 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:36,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:36,751 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:36,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:36,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:39,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:39,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 10:33:39,307 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:39,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:33:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:33:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:33:39,308 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-11-07 10:33:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:39,444 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-07 10:33:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:33:39,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 10:33:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:39,446 INFO L225 Difference]: With dead ends: 42 [2018-11-07 10:33:39,446 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:33:39,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:33:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:33:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 10:33:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 10:33:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 10:33:39,451 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-07 10:33:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:39,452 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 10:33:39,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:33:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 10:33:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:33:39,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:39,453 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:39,453 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:39,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:39,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1631958178, now seen corresponding path program 8 times [2018-11-07 10:33:39,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:39,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:39,455 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:39,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:39,674 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:39,675 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:39,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:39,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:39,675 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:39,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:39,683 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:39,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:33:39,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:39,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:39,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:40,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:40,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 10:33:40,670 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:33:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:33:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:33:40,671 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-11-07 10:33:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:40,835 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 10:33:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:33:40,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-07 10:33:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:40,837 INFO L225 Difference]: With dead ends: 45 [2018-11-07 10:33:40,838 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 10:33:40,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:33:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 10:33:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 10:33:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 10:33:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-07 10:33:40,843 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-07 10:33:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:40,843 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-07 10:33:40,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:33:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-07 10:33:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 10:33:40,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:40,844 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:40,844 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:40,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:40,844 INFO L82 PathProgramCache]: Analyzing trace with hash 198410683, now seen corresponding path program 9 times [2018-11-07 10:33:40,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:40,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:40,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:40,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:41,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:41,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:41,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:41,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:41,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:41,003 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:41,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:41,011 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:41,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:41,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:41,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:41,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:42,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:42,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 10:33:42,144 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:42,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:33:42,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:33:42,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:33:42,145 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-11-07 10:33:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:42,335 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-07 10:33:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:33:42,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-07 10:33:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:42,337 INFO L225 Difference]: With dead ends: 48 [2018-11-07 10:33:42,337 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 10:33:42,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:33:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 10:33:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-07 10:33:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 10:33:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 10:33:42,343 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-11-07 10:33:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:42,343 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 10:33:42,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:33:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 10:33:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:33:42,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:42,345 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:42,345 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:42,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash -187641282, now seen corresponding path program 10 times [2018-11-07 10:33:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:42,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:42,346 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:42,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:42,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:42,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:42,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:42,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:42,582 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:42,592 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:42,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:42,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:43,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:43,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 10:33:43,668 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:43,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:33:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:33:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:33:43,670 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2018-11-07 10:33:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:43,864 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 10:33:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:33:43,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 10:33:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:43,867 INFO L225 Difference]: With dead ends: 51 [2018-11-07 10:33:43,867 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 10:33:43,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:33:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 10:33:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-07 10:33:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 10:33:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-07 10:33:43,872 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-11-07 10:33:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:43,872 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-07 10:33:43,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:33:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-07 10:33:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 10:33:43,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:43,873 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:43,873 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:43,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash 860688091, now seen corresponding path program 11 times [2018-11-07 10:33:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:43,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:43,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:44,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:44,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:44,198 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:44,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:44,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:44,199 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:44,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:44,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:44,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:33:44,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:44,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:44,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:45,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:45,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 10:33:45,890 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:45,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:33:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:33:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:33:45,892 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-11-07 10:33:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:46,183 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-07 10:33:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:33:46,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 10:33:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:46,187 INFO L225 Difference]: With dead ends: 54 [2018-11-07 10:33:46,187 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 10:33:46,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:33:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 10:33:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 10:33:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:33:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 10:33:46,192 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-11-07 10:33:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:46,192 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 10:33:46,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:33:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 10:33:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:33:46,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:46,193 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:46,193 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:46,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1361137378, now seen corresponding path program 12 times [2018-11-07 10:33:46,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:46,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:46,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:46,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:46,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:46,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:46,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:46,671 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:46,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:46,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:46,672 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:46,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:46,682 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:46,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:46,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:46,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:46,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:48,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:48,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 10:33:48,058 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:48,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:33:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:33:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:33:48,059 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 15 states. [2018-11-07 10:33:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:48,384 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 10:33:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:33:48,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-07 10:33:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:48,385 INFO L225 Difference]: With dead ends: 57 [2018-11-07 10:33:48,385 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 10:33:48,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:33:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 10:33:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-07 10:33:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 10:33:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-07 10:33:48,391 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-11-07 10:33:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-07 10:33:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:33:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-07 10:33:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 10:33:48,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:48,392 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:48,392 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:48,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2022685701, now seen corresponding path program 13 times [2018-11-07 10:33:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:48,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:48,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:48,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:48,722 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:48,722 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:48,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:48,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:48,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:48,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:48,732 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:48,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:48,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:50,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 10:33:50,213 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:50,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:33:50,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:33:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:33:50,214 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2018-11-07 10:33:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:50,550 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-07 10:33:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:33:50,554 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-07 10:33:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:50,555 INFO L225 Difference]: With dead ends: 60 [2018-11-07 10:33:50,555 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 10:33:50,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:33:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 10:33:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-07 10:33:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 10:33:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 10:33:50,559 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-11-07 10:33:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:50,559 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 10:33:50,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:33:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 10:33:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 10:33:50,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:50,560 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:50,560 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:50,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash -603854850, now seen corresponding path program 14 times [2018-11-07 10:33:50,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:50,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:50,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:50,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:50,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:33:51,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:51,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:51,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:51,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:51,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:51,000 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:51,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:51,009 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:34:16,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 10:34:16,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:16,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:16,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 298 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:37,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:37,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 33 [2018-11-07 10:34:37,025 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:37,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:34:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:34:37,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=748, Unknown=4, NotChecked=0, Total=1056 [2018-11-07 10:34:37,026 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 17 states. [2018-11-07 10:34:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:37,544 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 10:34:37,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:34:37,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 10:34:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:37,548 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:34:37,548 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:34:37,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=304, Invalid=748, Unknown=4, NotChecked=0, Total=1056 [2018-11-07 10:34:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:34:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-07 10:34:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 10:34:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-07 10:34:37,553 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-11-07 10:34:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:37,554 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-07 10:34:37,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:34:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-07 10:34:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 10:34:37,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:37,555 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:37,555 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:37,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1012867355, now seen corresponding path program 15 times [2018-11-07 10:34:37,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:37,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:37,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:38,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:38,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:38,183 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:38,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:38,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:38,183 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:38,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:34:38,192 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:34:38,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:34:38,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:38,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:38,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:40,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:40,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 10:34:40,103 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:40,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:34:40,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:34:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:34:40,104 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-11-07 10:34:40,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:40,492 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 10:34:40,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 10:34:40,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-07 10:34:40,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:40,494 INFO L225 Difference]: With dead ends: 66 [2018-11-07 10:34:40,494 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 10:34:40,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:34:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 10:34:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 10:34:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:34:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 10:34:40,498 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-11-07 10:34:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:40,499 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 10:34:40,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:34:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 10:34:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:34:40,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:40,500 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:40,500 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:40,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1020819166, now seen corresponding path program 16 times [2018-11-07 10:34:40,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:40,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:40,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:41,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:41,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:41,285 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:41,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:41,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:41,285 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:41,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:41,294 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:34:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:41,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:41,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:43,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:43,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 10:34:43,398 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:43,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:34:43,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:34:43,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:34:43,399 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-11-07 10:34:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:43,857 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-07 10:34:43,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:34:43,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 10:34:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:43,858 INFO L225 Difference]: With dead ends: 69 [2018-11-07 10:34:43,859 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 10:34:43,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:34:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 10:34:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 10:34:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 10:34:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-07 10:34:43,864 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-11-07 10:34:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:43,864 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-07 10:34:43,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:34:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-07 10:34:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 10:34:43,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:43,865 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:43,865 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:43,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1690019387, now seen corresponding path program 17 times [2018-11-07 10:34:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:43,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:44,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:44,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:44,391 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:44,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:44,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:44,392 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:44,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:34:44,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:34:45,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 10:34:45,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:45,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:45,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:48,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:48,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 10:34:48,455 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:48,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:34:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:34:48,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:34:48,456 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 20 states. [2018-11-07 10:34:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:49,124 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-07 10:34:49,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:34:49,125 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-07 10:34:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:49,126 INFO L225 Difference]: With dead ends: 72 [2018-11-07 10:34:49,126 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 10:34:49,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:34:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 10:34:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-07 10:34:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:34:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-07 10:34:49,130 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-11-07 10:34:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:49,130 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-07 10:34:49,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:34:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-07 10:34:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 10:34:49,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:49,131 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:49,131 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:49,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash 595615166, now seen corresponding path program 18 times [2018-11-07 10:34:49,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:49,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:49,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:49,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:49,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:49,710 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:49,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:49,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:49,711 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:49,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:34:49,720 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:34:49,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:34:49,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:34:49,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:49,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:52,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:52,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 10:34:52,548 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:52,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:34:52,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:34:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:34:52,550 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 21 states. [2018-11-07 10:34:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:53,056 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 10:34:53,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:34:53,056 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-07 10:34:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:53,057 INFO L225 Difference]: With dead ends: 75 [2018-11-07 10:34:53,057 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 10:34:53,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:34:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 10:34:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-07 10:34:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 10:34:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-07 10:34:53,062 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-11-07 10:34:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:53,062 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-07 10:34:53,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:34:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-07 10:34:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-07 10:34:53,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:53,063 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:53,064 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:53,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:53,064 INFO L82 PathProgramCache]: Analyzing trace with hash 296211291, now seen corresponding path program 19 times [2018-11-07 10:34:53,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:53,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:53,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:34:53,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:53,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:54,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:54,064 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:54,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:54,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:54,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:54,065 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:54,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:54,074 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:34:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:54,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:34:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:54,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:34:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:57,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:34:57,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 10:34:57,095 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:34:57,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:34:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:34:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:34:57,097 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 22 states. [2018-11-07 10:34:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:34:57,655 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 10:34:57,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:34:57,656 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-07 10:34:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:34:57,657 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:34:57,657 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 10:34:57,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:34:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 10:34:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 10:34:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 10:34:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 10:34:57,662 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-11-07 10:34:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:34:57,663 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 10:34:57,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:34:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 10:34:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 10:34:57,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:34:57,663 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:34:57,663 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:34:57,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:34:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1402444958, now seen corresponding path program 20 times [2018-11-07 10:34:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:34:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:57,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:34:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:34:57,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:34:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:34:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:34:58,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:58,116 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:34:58,116 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:34:58,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:34:58,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:34:58,117 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:34:58,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:34:58,134 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:35:13,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 10:35:13,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:35:13,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:13,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:16,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 10:35:16,840 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:16,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:35:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:35:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:35:16,841 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 23 states. [2018-11-07 10:35:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:17,466 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-07 10:35:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:35:17,466 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-07 10:35:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:17,467 INFO L225 Difference]: With dead ends: 81 [2018-11-07 10:35:17,468 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 10:35:17,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:35:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 10:35:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-07 10:35:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 10:35:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-07 10:35:17,473 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-11-07 10:35:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:17,473 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-07 10:35:17,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:35:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-07 10:35:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 10:35:17,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:17,474 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:17,474 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:17,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1925556347, now seen corresponding path program 21 times [2018-11-07 10:35:17,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:17,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:17,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:35:17,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:17,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:18,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:18,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:18,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:18,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:18,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:18,429 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:35:18,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:35:18,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:35:18,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:35:18,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:18,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:21,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:21,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 10:35:21,838 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:21,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:35:21,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:35:21,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:35:21,839 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-11-07 10:35:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:22,513 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-07 10:35:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:35:22,514 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 10:35:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:22,515 INFO L225 Difference]: With dead ends: 84 [2018-11-07 10:35:22,515 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 10:35:22,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:35:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 10:35:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-07 10:35:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 10:35:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-07 10:35:22,520 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-11-07 10:35:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:22,520 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-07 10:35:22,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:35:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-07 10:35:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 10:35:22,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:22,521 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:22,522 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:22,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash -499371138, now seen corresponding path program 22 times [2018-11-07 10:35:22,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:22,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:35:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:22,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:23,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:23,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:23,164 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:23,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:23,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:23,164 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:23,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:23,172 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:35:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:23,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:35:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:23,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:35:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:27,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:35:27,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 10:35:27,190 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:35:27,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:35:27,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:35:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:35:27,191 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-11-07 10:35:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:35:27,942 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 10:35:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:35:27,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 10:35:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:35:27,944 INFO L225 Difference]: With dead ends: 87 [2018-11-07 10:35:27,944 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 10:35:27,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:35:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 10:35:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-07 10:35:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 10:35:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-07 10:35:27,950 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-11-07 10:35:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:35:27,950 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-07 10:35:27,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:35:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-07 10:35:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 10:35:27,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:35:27,951 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:35:27,951 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:35:27,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:35:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash -164158053, now seen corresponding path program 23 times [2018-11-07 10:35:27,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:35:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:27,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:35:27,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:35:27,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:35:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:35:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:35:28,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:28,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:35:28,668 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:35:28,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:35:28,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:35:28,668 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:35:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:35:28,681 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:03,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 10:37:03,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:03,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:03,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:30,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 51 [2018-11-07 10:37:30,458 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:30,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:37:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:37:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=1843, Unknown=7, NotChecked=0, Total=2550 [2018-11-07 10:37:30,459 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 26 states. [2018-11-07 10:37:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:31,258 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-07 10:37:31,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:37:31,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-07 10:37:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:31,259 INFO L225 Difference]: With dead ends: 90 [2018-11-07 10:37:31,259 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 10:37:31,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=700, Invalid=1843, Unknown=7, NotChecked=0, Total=2550 [2018-11-07 10:37:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 10:37:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-07 10:37:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 10:37:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-07 10:37:31,265 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-11-07 10:37:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:31,265 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-07 10:37:31,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:37:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-07 10:37:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 10:37:31,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:31,266 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:31,268 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:31,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:31,268 INFO L82 PathProgramCache]: Analyzing trace with hash 369893982, now seen corresponding path program 24 times [2018-11-07 10:37:31,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:31,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:31,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:31,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:31,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:32,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:32,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:32,616 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:32,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:37:32,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:32,616 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:32,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:32,626 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:32,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:32,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:32,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:37:32,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 10:37:34,867 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 10:37:35,067 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:37:35,068 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:37:35,073 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:37:35,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:37:35 BoogieIcfgContainer [2018-11-07 10:37:35,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:37:35,074 INFO L168 Benchmark]: Toolchain (without parser) took 274896.25 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 934.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -366.4 MB). Peak memory consumption was 567.9 MB. Max. memory is 7.1 GB. [2018-11-07 10:37:35,074 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:37:35,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.50 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 10:37:35,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.45 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 10:37:35,076 INFO L168 Benchmark]: Boogie Preprocessor took 20.99 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 10:37:35,076 INFO L168 Benchmark]: RCFGBuilder took 365.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:37:35,076 INFO L168 Benchmark]: TraceAbstraction took 274169.82 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 192.4 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 419.2 MB). Peak memory consumption was 611.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:37:35,080 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.50 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 18.45 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 20.99 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 365.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 274169.82 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 192.4 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 419.2 MB). Peak memory consumption was 611.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 25,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 43 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 274.1s OverallTime, 33 OverallIterations, 25 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 656 SDtfs, 34 SDslu, 7220 SDs, 0 SdLazy, 10662 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2823 GetRequests, 2104 SyntacticMatches, 64 SemanticMatches, 655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 94.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 34 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 162.6s SatisfiabilityAnalysisTime, 96.3s InterpolantComputationTime, 2451 NumberOfCodeBlocks, 2442 NumberOfCodeBlocksAsserted, 176 NumberOfCheckSat, 3574 ConstructedInterpolants, 1 QuantifiedInterpolants, 1135360 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2488 ConjunctsInSsa, 671 ConjunctsInUnsatCore, 92 InterpolantComputations, 8 PerfectInterpolantSequences, 108/20184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown