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-invgen/half_2_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:36:34,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:36:34,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:36:34,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:36:34,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:36:34,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:36:34,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:36:34,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:36:34,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:36:34,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:36:34,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:36:34,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:36:34,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:36:34,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:36:34,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:36:34,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:36:34,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:36:34,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:36:34,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:36:34,536 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:36:34,537 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:36:34,538 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:36:34,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:36:34,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:36:34,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:36:34,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:36:34,543 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:36:34,544 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:36:34,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:36:34,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:36:34,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:36:34,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:36:34,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:36:34,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:36:34,548 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:36:34,549 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:36:34,549 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:36:34,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:36:34,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:36:34,565 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:36:34,566 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:36:34,567 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:36:34,567 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:36:34,567 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:36:34,568 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:36:34,568 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:36:34,568 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:36:34,568 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:36:34,568 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:36:34,569 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:36:34,569 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:36:34,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:36:34,570 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:36:34,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:36:34,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:36:34,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:36:34,571 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:36:34,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:36:34,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:36:34,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:36:34,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:36:34,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:36:34,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:36:34,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:36:34,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:36:34,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:36:34,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:36:34,574 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:36:34,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:36:34,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:36:34,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:36:34,574 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:36:34,574 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:36:34,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:36:34,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:36:34,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:36:34,639 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:36:34,640 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:36:34,640 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2_true-unreach-call_true-termination.i [2018-11-07 10:36:34,694 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16abb0771/49bdee53d68a44aeabf4ad7f01fc012b/FLAG48c76e519 [2018-11-07 10:36:35,162 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:36:35,164 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2_true-unreach-call_true-termination.i [2018-11-07 10:36:35,171 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16abb0771/49bdee53d68a44aeabf4ad7f01fc012b/FLAG48c76e519 [2018-11-07 10:36:35,191 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16abb0771/49bdee53d68a44aeabf4ad7f01fc012b [2018-11-07 10:36:35,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:36:35,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:36:35,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:35,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:36:35,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:36:35,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5492fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35, skipping insertion in model container [2018-11-07 10:36:35,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:36:35,256 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:36:35,440 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:35,444 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:36:35,463 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:35,479 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:36:35,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35 WrapperNode [2018-11-07 10:36:35,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:35,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:35,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:36:35,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:36:35,491 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:36:35" (1/1) ... [2018-11-07 10:36:35,497 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:36:35" (1/1) ... [2018-11-07 10:36:35,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:35,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:36:35,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:36:35,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:36:35,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (1/1) ... [2018-11-07 10:36:35,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:36:35,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:36:35,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:36:35,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:36:35,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (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:36:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:36:35,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:36:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:36:35,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:36:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:36:35,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:36:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:36:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:36:36,008 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:36:36,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:36 BoogieIcfgContainer [2018-11-07 10:36:36,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:36:36,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:36:36,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:36:36,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:36:36,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:36:35" (1/3) ... [2018-11-07 10:36:36,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64150939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:36, skipping insertion in model container [2018-11-07 10:36:36,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:35" (2/3) ... [2018-11-07 10:36:36,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64150939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:36, skipping insertion in model container [2018-11-07 10:36:36,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:36" (3/3) ... [2018-11-07 10:36:36,020 INFO L112 eAbstractionObserver]: Analyzing ICFG half_2_true-unreach-call_true-termination.i [2018-11-07 10:36:36,030 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:36:36,039 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:36:36,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:36:36,094 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:36:36,094 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:36:36,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:36:36,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:36:36,095 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:36:36,095 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:36:36,095 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:36:36,095 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:36:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-07 10:36:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:36:36,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:36,130 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:36,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:36,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:36,141 INFO L82 PathProgramCache]: Analyzing trace with hash 123572206, now seen corresponding path program 1 times [2018-11-07 10:36:36,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:36,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:36,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:36,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:36,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:36,282 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:36:36,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:36,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:36:36,285 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:36,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:36:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:36:36,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:36:36,305 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-07 10:36:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:36,328 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-07 10:36:36,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:36:36,330 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 10:36:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:36,339 INFO L225 Difference]: With dead ends: 40 [2018-11-07 10:36:36,339 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 10:36:36,343 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:36:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 10:36:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 10:36:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 10:36:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 10:36:36,381 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 10:36:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:36,381 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 10:36:36,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:36:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 10:36:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:36:36,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:36,383 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:36,383 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:36,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash -204041864, now seen corresponding path program 1 times [2018-11-07 10:36:36,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:36,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:36,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:36,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:36,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:36,627 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:36:36,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:36,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:36:36,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:36,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:36:36,630 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-07 10:36:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:36,835 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-07 10:36:36,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:36,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 10:36:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:36,836 INFO L225 Difference]: With dead ends: 34 [2018-11-07 10:36:36,838 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 10:36:36,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:36:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 10:36:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-07 10:36:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:36:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 10:36:36,847 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-07 10:36:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:36,847 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 10:36:36,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 10:36:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:36:36,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:36,849 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:36,849 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:36,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash 615296882, now seen corresponding path program 1 times [2018-11-07 10:36:36,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:36,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:36,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:36,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:36,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:37,264 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:36:37,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:37,264 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:37,266 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 10:36:37,267 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [26], [32], [40], [43], [45], [51], [52], [53], [55] [2018-11-07 10:36:37,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:37,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:37,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:37,493 INFO L272 AbstractInterpreter]: Visited 16 different actions 36 times. Merged at 6 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-07 10:36:37,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:37,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:37,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:37,517 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:36:37,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:37,531 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:37,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:37,701 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:36:37,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:38,084 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-07 10:36:38,215 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:36:38,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:38,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 10:36:38,239 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:38,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:36:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:36:38,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:36:38,241 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2018-11-07 10:36:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:38,834 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-07 10:36:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:36:38,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-07 10:36:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:38,836 INFO L225 Difference]: With dead ends: 38 [2018-11-07 10:36:38,837 INFO L226 Difference]: Without dead ends: 23 [2018-11-07 10:36:38,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:36:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-07 10:36:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-07 10:36:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 10:36:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-07 10:36:38,844 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2018-11-07 10:36:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:38,845 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-07 10:36:38,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:36:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-07 10:36:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:36:38,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:38,846 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:38,846 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:38,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2020816620, now seen corresponding path program 2 times [2018-11-07 10:36:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:38,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:38,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:38,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:38,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:38,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:38,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:38,938 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:38,938 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:36:38,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:38,939 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:36:38,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:36:38,957 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:39,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:36:39,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:39,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:39,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:39,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:39,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 10:36:39,211 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:39,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:36:39,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:36:39,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:36:39,213 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-11-07 10:36:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:39,331 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-07 10:36:39,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:36:39,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-07 10:36:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:39,334 INFO L225 Difference]: With dead ends: 37 [2018-11-07 10:36:39,335 INFO L226 Difference]: Without dead ends: 35 [2018-11-07 10:36:39,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:36:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-07 10:36:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-07 10:36:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 10:36:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-07 10:36:39,347 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 19 [2018-11-07 10:36:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:39,347 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-07 10:36:39,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:36:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-07 10:36:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:36:39,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:39,349 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:39,349 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:39,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 214509359, now seen corresponding path program 1 times [2018-11-07 10:36:39,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:39,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:39,351 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:39,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:39,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:39,787 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-07 10:36:39,787 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [26], [32], [34], [40], [43], [45], [48], [50], [51], [52], [53], [55], [56] [2018-11-07 10:36:39,789 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:39,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:39,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:39,927 INFO L272 AbstractInterpreter]: Visited 20 different actions 68 times. Merged at 8 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 8 variables. [2018-11-07 10:36:39,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:39,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:39,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:39,940 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:36:39,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:39,953 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:39,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:40,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:40,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:40,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2018-11-07 10:36:40,893 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:40,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:36:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:36:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:36:40,895 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 18 states. [2018-11-07 10:36:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:41,275 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-07 10:36:41,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:36:41,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-11-07 10:36:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:41,278 INFO L225 Difference]: With dead ends: 55 [2018-11-07 10:36:41,278 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 10:36:41,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:36:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 10:36:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 10:36:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 10:36:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 10:36:41,286 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2018-11-07 10:36:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:41,286 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 10:36:41,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:36:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 10:36:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:36:41,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:41,288 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:41,288 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:41,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1884298793, now seen corresponding path program 2 times [2018-11-07 10:36:41,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:41,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:41,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:41,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:41,409 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:41,409 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:41,409 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:36:41,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:41,409 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:36:41,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:36:41,418 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:41,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:36:41,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:41,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:41,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:41,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:41,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2018-11-07 10:36:41,763 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:41,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:36:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:36:41,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:36:41,765 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2018-11-07 10:36:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:42,199 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-07 10:36:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:36:42,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-07 10:36:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:42,203 INFO L225 Difference]: With dead ends: 47 [2018-11-07 10:36:42,203 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 10:36:42,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:36:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 10:36:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-11-07 10:36:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 10:36:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-07 10:36:42,212 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 29 [2018-11-07 10:36:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:42,213 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-07 10:36:42,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:36:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-07 10:36:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 10:36:42,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:42,214 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:42,215 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:42,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2099085676, now seen corresponding path program 3 times [2018-11-07 10:36:42,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:42,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:42,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:36:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:42,662 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:42,662 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:42,662 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:36:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:42,662 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:36:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:36:42,673 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:36:42,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:36:42,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:42,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:36:43,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:36:43,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:43,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2018-11-07 10:36:43,913 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:43,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:36:43,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:36:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:36:43,917 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 22 states. [2018-11-07 10:36:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:44,545 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-11-07 10:36:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:36:44,545 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-11-07 10:36:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:44,547 INFO L225 Difference]: With dead ends: 79 [2018-11-07 10:36:44,547 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 10:36:44,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:36:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 10:36:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2018-11-07 10:36:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 10:36:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-07 10:36:44,557 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2018-11-07 10:36:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:44,558 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-07 10:36:44,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:36:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-07 10:36:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:36:44,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:44,559 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:44,559 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:44,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:44,559 INFO L82 PathProgramCache]: Analyzing trace with hash -599816218, now seen corresponding path program 4 times [2018-11-07 10:36:44,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:44,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:44,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:44,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:36:44,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:44,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:44,773 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:44,773 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:36:44,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:44,773 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:36:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:44,784 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:44,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:36:44,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:36:45,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:45,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2018-11-07 10:36:45,109 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:45,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:36:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:36:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:36:45,110 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 18 states. [2018-11-07 10:36:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:45,372 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-07 10:36:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:36:45,372 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-07 10:36:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:45,374 INFO L225 Difference]: With dead ends: 57 [2018-11-07 10:36:45,374 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 10:36:45,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:36:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 10:36:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-07 10:36:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 10:36:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-07 10:36:45,383 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 39 [2018-11-07 10:36:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:45,384 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-07 10:36:45,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:36:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-07 10:36:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:36:45,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:45,385 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:45,385 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:45,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:45,386 INFO L82 PathProgramCache]: Analyzing trace with hash 303685161, now seen corresponding path program 5 times [2018-11-07 10:36:45,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:45,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:45,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:45,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:45,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:45,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:45,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:45,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:45,727 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:36:45,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:45,727 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:36:45,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:36:45,746 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:45,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:36:45,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:45,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:46,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:46,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:46,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2018-11-07 10:36:46,817 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:46,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:36:46,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:36:46,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:36:46,819 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 28 states. [2018-11-07 10:36:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:47,933 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-11-07 10:36:47,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:36:47,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-11-07 10:36:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:47,935 INFO L225 Difference]: With dead ends: 79 [2018-11-07 10:36:47,935 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 10:36:47,937 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=324, Invalid=2538, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 10:36:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 10:36:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-07 10:36:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 10:36:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-07 10:36:47,944 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2018-11-07 10:36:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:47,945 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-07 10:36:47,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:36:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-07 10:36:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 10:36:47,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:47,947 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:47,947 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:47,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1075211229, now seen corresponding path program 6 times [2018-11-07 10:36:47,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:47,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:47,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:47,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:47,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:48,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:48,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:48,149 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:48,149 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:36:48,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:48,149 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:36:48,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:36:48,160 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:36:48,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:36:48,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:48,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:48,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 28 [2018-11-07 10:36:48,575 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:48,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:36:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:36:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-11-07 10:36:48,577 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 21 states. [2018-11-07 10:36:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:48,914 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-07 10:36:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 10:36:48,915 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-07 10:36:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:48,916 INFO L225 Difference]: With dead ends: 67 [2018-11-07 10:36:48,917 INFO L226 Difference]: Without dead ends: 65 [2018-11-07 10:36:48,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 10:36:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-07 10:36:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-11-07 10:36:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:36:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-07 10:36:48,925 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 49 [2018-11-07 10:36:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:48,926 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-07 10:36:48,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:36:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-07 10:36:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 10:36:48,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:48,927 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:48,927 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:48,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash 893803878, now seen corresponding path program 7 times [2018-11-07 10:36:48,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:48,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:48,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:36:49,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:49,377 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:49,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:49,378 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:36:49,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:49,378 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:36:49,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:49,388 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:49,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 76 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:36:49,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 76 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:36:50,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:50,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2018-11-07 10:36:50,732 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:50,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:36:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:36:50,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:36:50,734 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2018-11-07 10:36:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:52,188 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-07 10:36:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:36:52,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-11-07 10:36:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:52,190 INFO L225 Difference]: With dead ends: 115 [2018-11-07 10:36:52,190 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 10:36:52,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=362, Invalid=2290, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:36:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 10:36:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-11-07 10:36:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 10:36:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-07 10:36:52,202 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 57 [2018-11-07 10:36:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:52,202 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-07 10:36:52,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:36:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-07 10:36:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:36:52,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:52,204 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:52,204 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:52,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1175347936, now seen corresponding path program 8 times [2018-11-07 10:36:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:52,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:52,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:36:52,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:52,539 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:52,539 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:52,539 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:36:52,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:52,539 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:36:52,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:36:52,550 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:36:52,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:36:52,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:52,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:36:52,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:36:53,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:53,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2018-11-07 10:36:53,055 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:53,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:36:53,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:36:53,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:36:53,057 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 24 states. [2018-11-07 10:36:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:53,533 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-07 10:36:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:36:53,534 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-07 10:36:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:53,536 INFO L225 Difference]: With dead ends: 77 [2018-11-07 10:36:53,536 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 10:36:53,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:36:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 10:36:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-11-07 10:36:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 10:36:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-07 10:36:53,547 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2018-11-07 10:36:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:53,547 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-07 10:36:53,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:36:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-07 10:36:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 10:36:53,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:53,549 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:53,549 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:53,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -549249245, now seen corresponding path program 9 times [2018-11-07 10:36:53,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:53,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:53,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:53,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 49 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:36:54,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:54,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:54,118 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:54,118 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:36:54,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:54,118 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:36:54,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:36:54,127 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:36:54,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:36:54,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:36:54,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 21 proven. 98 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:36:54,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 21 proven. 98 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:36:56,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:56,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 49 [2018-11-07 10:36:56,125 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:56,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:36:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:36:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2046, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:36:56,127 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 34 states. [2018-11-07 10:36:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:57,027 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2018-11-07 10:36:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:36:57,028 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-11-07 10:36:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:57,030 INFO L225 Difference]: With dead ends: 133 [2018-11-07 10:36:57,031 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 10:36:57,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=454, Invalid=2968, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 10:36:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 10:36:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-11-07 10:36:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 10:36:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-07 10:36:57,041 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2018-11-07 10:36:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:57,041 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-07 10:36:57,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:36:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-07 10:36:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:36:57,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:57,042 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:57,043 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:57,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash 42341405, now seen corresponding path program 10 times [2018-11-07 10:36:57,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:57,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:57,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:36:57,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:57,044 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 51 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:36:57,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:57,704 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:57,704 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:36:57,704 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:36:57,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:57,704 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:36:57,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:57,713 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:57,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 111 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:36:57,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 111 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:36:58,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:58,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2018-11-07 10:36:58,637 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:58,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:36:58,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:36:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:36:58,639 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 27 states. [2018-11-07 10:36:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:59,131 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-07 10:36:59,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:36:59,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-11-07 10:36:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:59,134 INFO L225 Difference]: With dead ends: 87 [2018-11-07 10:36:59,134 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 10:36:59,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=413, Invalid=1843, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:36:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 10:36:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-11-07 10:36:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-07 10:36:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-07 10:36:59,143 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 69 [2018-11-07 10:36:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:59,143 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-07 10:36:59,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:36:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-07 10:36:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 10:36:59,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:59,144 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:59,145 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:59,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash -641186976, now seen corresponding path program 11 times [2018-11-07 10:36:59,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:59,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:59,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 71 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:37:00,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:00,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:00,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:00,772 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:00,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:00,772 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:37:00,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:00,792 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:00,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:37:00,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:00,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 135 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:37:01,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 135 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:37:02,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:02,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 56 [2018-11-07 10:37:02,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:02,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:37:02,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:37:02,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2700, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:37:02,427 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 39 states. [2018-11-07 10:37:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:03,653 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-11-07 10:37:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:37:03,653 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2018-11-07 10:37:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:03,655 INFO L225 Difference]: With dead ends: 121 [2018-11-07 10:37:03,655 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 10:37:03,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=553, Invalid=4003, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:37:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 10:37:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-07 10:37:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 10:37:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-07 10:37:03,665 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2018-11-07 10:37:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-07 10:37:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:37:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-07 10:37:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:37:03,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:03,667 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:03,667 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:03,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1270822950, now seen corresponding path program 12 times [2018-11-07 10:37:03,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:03,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:03,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 67 proven. 110 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:37:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:04,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:04,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:04,236 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:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:04,236 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:37:04,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:04,245 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:04,268 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:04,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:04,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 11 proven. 166 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:37:04,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 11 proven. 166 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:37:05,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:05,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 40 [2018-11-07 10:37:05,117 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:05,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:37:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:37:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:37:05,120 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 30 states. [2018-11-07 10:37:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:05,753 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-11-07 10:37:05,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:37:05,754 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-11-07 10:37:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:05,755 INFO L225 Difference]: With dead ends: 97 [2018-11-07 10:37:05,755 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 10:37:05,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 131 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=533, Invalid=2547, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:37:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 10:37:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-11-07 10:37:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 10:37:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-11-07 10:37:05,765 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 79 [2018-11-07 10:37:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:05,765 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-11-07 10:37:05,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:37:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-07 10:37:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 10:37:05,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:05,767 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:05,767 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:05,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2119833059, now seen corresponding path program 13 times [2018-11-07 10:37:05,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:05,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:05,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 97 proven. 112 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 10:37:06,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:06,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:06,504 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:06,505 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:06,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:06,505 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:37:06,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:06,514 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:06,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 13 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 10:37:07,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 13 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 10:37:08,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:08,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 61 [2018-11-07 10:37:08,401 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:08,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:37:08,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:37:08,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:37:08,403 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 42 states. [2018-11-07 10:37:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:09,546 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-11-07 10:37:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 10:37:09,547 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 87 [2018-11-07 10:37:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:09,549 INFO L225 Difference]: With dead ends: 169 [2018-11-07 10:37:09,549 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 10:37:09,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 134 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=686, Invalid=4570, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:37:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 10:37:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-11-07 10:37:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 10:37:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-07 10:37:09,562 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2018-11-07 10:37:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:09,562 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-07 10:37:09,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:37:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-07 10:37:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 10:37:09,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:09,563 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:09,564 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:09,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:09,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2025415145, now seen corresponding path program 14 times [2018-11-07 10:37:09,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:09,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:09,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:09,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:09,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 85 proven. 142 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 10:37:09,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:09,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:09,799 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:09,800 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:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:09,800 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:37:09,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:09,811 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:09,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:37:09,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:09,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 31 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 10:37:10,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 31 proven. 196 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 10:37:10,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:10,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 44 [2018-11-07 10:37:10,493 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:10,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:37:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:37:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:37:10,494 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 33 states. [2018-11-07 10:37:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:11,197 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-07 10:37:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:37:11,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 89 [2018-11-07 10:37:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:11,199 INFO L225 Difference]: With dead ends: 107 [2018-11-07 10:37:11,200 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 10:37:11,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 148 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=673, Invalid=3109, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 10:37:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 10:37:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-11-07 10:37:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 10:37:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-11-07 10:37:11,209 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 89 [2018-11-07 10:37:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:11,209 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-11-07 10:37:11,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:37:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-11-07 10:37:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 10:37:11,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:11,211 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:11,211 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:11,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash 147075930, now seen corresponding path program 15 times [2018-11-07 10:37:11,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:11,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:11,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 127 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 10:37:11,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:11,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:11,934 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:11,934 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:11,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:11,935 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:37:11,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:11,964 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:11,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:11,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:11,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 10:37:12,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 10:37:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:14,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 67 [2018-11-07 10:37:14,115 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:14,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:37:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:37:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3861, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:37:14,117 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 46 states. [2018-11-07 10:37:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:15,475 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-11-07 10:37:15,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:37:15,475 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 97 [2018-11-07 10:37:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:15,476 INFO L225 Difference]: With dead ends: 187 [2018-11-07 10:37:15,477 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 10:37:15,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=811, Invalid=5509, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:37:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 10:37:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-11-07 10:37:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 10:37:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-11-07 10:37:15,487 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 97 [2018-11-07 10:37:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:15,487 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-11-07 10:37:15,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 10:37:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-11-07 10:37:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:37:15,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:15,488 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:15,488 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -692603180, now seen corresponding path program 16 times [2018-11-07 10:37:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:15,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:15,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:15,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:15,490 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 105 proven. 178 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 10:37:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:15,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:15,781 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:15,781 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:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:15,781 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:37:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:15,792 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:15,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 16 proven. 246 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:37:16,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 16 proven. 246 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:37:16,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:16,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2018-11-07 10:37:16,988 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:16,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:37:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:37:16,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1733, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 10:37:16,989 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 36 states. [2018-11-07 10:37:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:17,822 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-11-07 10:37:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:37:17,822 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-11-07 10:37:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:17,824 INFO L225 Difference]: With dead ends: 117 [2018-11-07 10:37:17,824 INFO L226 Difference]: Without dead ends: 115 [2018-11-07 10:37:17,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 169 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 10:37:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-07 10:37:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2018-11-07 10:37:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-07 10:37:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-07 10:37:17,833 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 99 [2018-11-07 10:37:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:17,834 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-07 10:37:17,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:37:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-07 10:37:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 10:37:17,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:17,835 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:17,835 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:17,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash 941834007, now seen corresponding path program 17 times [2018-11-07 10:37:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:17,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:17,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:17,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:17,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 161 proven. 162 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:37:18,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:18,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:18,774 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:18,774 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:18,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:18,774 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:37:18,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:18,783 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:18,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:37:18,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:18,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 41 proven. 282 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:37:19,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 41 proven. 282 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:37:20,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:20,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 28] total 74 [2018-11-07 10:37:20,790 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:20,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:37:20,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:37:20,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=4734, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:37:20,792 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 51 states. [2018-11-07 10:37:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:22,412 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-07 10:37:22,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 10:37:22,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 107 [2018-11-07 10:37:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:22,414 INFO L225 Difference]: With dead ends: 163 [2018-11-07 10:37:22,414 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 10:37:22,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2895 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=931, Invalid=6901, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 10:37:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 10:37:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-07 10:37:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-07 10:37:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-11-07 10:37:22,425 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2018-11-07 10:37:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:22,425 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-11-07 10:37:22,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:37:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-11-07 10:37:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 10:37:22,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:22,426 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:22,427 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:22,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1858875921, now seen corresponding path program 18 times [2018-11-07 10:37:22,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:22,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:22,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:22,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:22,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 127 proven. 218 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:37:23,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:23,158 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:23,158 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:23,158 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:23,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:23,158 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:37:23,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:23,166 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:23,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:23,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:23,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 17 proven. 328 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:37:23,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 17 proven. 328 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 10:37:24,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:24,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 52 [2018-11-07 10:37:24,063 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:24,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:37:24,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:37:24,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2247, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:37:24,064 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 39 states. [2018-11-07 10:37:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:24,987 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-11-07 10:37:24,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 10:37:24,990 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2018-11-07 10:37:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:24,992 INFO L225 Difference]: With dead ends: 127 [2018-11-07 10:37:24,992 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 10:37:24,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 182 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=938, Invalid=4464, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 10:37:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 10:37:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2018-11-07 10:37:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 10:37:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-11-07 10:37:25,002 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 109 [2018-11-07 10:37:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:25,002 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-11-07 10:37:25,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:37:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-11-07 10:37:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 10:37:25,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:25,004 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:25,004 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:25,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1311036076, now seen corresponding path program 19 times [2018-11-07 10:37:25,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:25,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:25,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 199 proven. 190 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:37:26,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,054 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:26,054 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:26,054 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:26,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:26,054 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:37:26,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:26,063 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:26,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 19 proven. 370 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:37:27,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 19 proven. 370 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:37:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 79 [2018-11-07 10:37:29,146 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:29,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 10:37:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 10:37:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=5377, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:37:29,148 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 54 states. [2018-11-07 10:37:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:32,115 INFO L93 Difference]: Finished difference Result 223 states and 228 transitions. [2018-11-07 10:37:32,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 10:37:32,115 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 117 [2018-11-07 10:37:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:32,117 INFO L225 Difference]: With dead ends: 223 [2018-11-07 10:37:32,117 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 10:37:32,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 182 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1118, Invalid=7624, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 10:37:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 10:37:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-11-07 10:37:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 10:37:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-11-07 10:37:32,128 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 117 [2018-11-07 10:37:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:32,128 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-11-07 10:37:32,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 10:37:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-11-07 10:37:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:37:32,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:32,129 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:32,130 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:32,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1322528718, now seen corresponding path program 20 times [2018-11-07 10:37:32,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:32,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:32,131 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 151 proven. 262 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:37:32,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:32,445 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:32,445 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:32,445 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,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:32,445 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:37:32,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:32,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:32,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 10:37:32,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:32,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 46 proven. 367 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:37:33,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 46 proven. 367 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:37:33,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:33,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2018-11-07 10:37:33,862 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:33,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:37:33,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:37:33,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2601, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 10:37:33,863 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 42 states. [2018-11-07 10:37:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:34,968 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-11-07 10:37:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:37:34,968 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 119 [2018-11-07 10:37:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:34,970 INFO L225 Difference]: With dead ends: 137 [2018-11-07 10:37:34,971 INFO L226 Difference]: Without dead ends: 135 [2018-11-07 10:37:34,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 199 SyntacticMatches, 14 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2051 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1126, Invalid=5194, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:37:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-07 10:37:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-11-07 10:37:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-07 10:37:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-11-07 10:37:34,982 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 119 [2018-11-07 10:37:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:34,982 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-11-07 10:37:34,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:37:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-11-07 10:37:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 10:37:34,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:34,983 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:34,983 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:34,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:34,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1290002927, now seen corresponding path program 21 times [2018-11-07 10:37:34,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:34,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:34,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:34,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:34,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 241 proven. 220 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 10:37:35,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:35,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:35,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:35,937 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:35,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:35,938 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:37:35,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:35,947 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:35,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:35,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:35,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 51 proven. 410 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 10:37:37,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 51 proven. 410 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 10:37:39,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:39,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 85 [2018-11-07 10:37:39,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:39,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 10:37:39,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 10:37:39,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=897, Invalid=6243, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:37:39,578 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 58 states. [2018-11-07 10:37:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:41,781 INFO L93 Difference]: Finished difference Result 241 states and 246 transitions. [2018-11-07 10:37:41,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:37:41,781 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 127 [2018-11-07 10:37:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:41,783 INFO L225 Difference]: With dead ends: 241 [2018-11-07 10:37:41,783 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 10:37:41,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 198 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2904 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1276, Invalid=8824, Unknown=0, NotChecked=0, Total=10100 [2018-11-07 10:37:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 10:37:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2018-11-07 10:37:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 10:37:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-11-07 10:37:41,794 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2018-11-07 10:37:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:41,794 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-11-07 10:37:41,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 10:37:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-11-07 10:37:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:37:41,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:41,795 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:41,795 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:41,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash -348663797, now seen corresponding path program 22 times [2018-11-07 10:37:41,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:41,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:41,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:41,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 177 proven. 310 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 10:37:42,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:42,264 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:42,264 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:42,264 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:42,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:42,265 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:37:42,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:42,274 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:42,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 22 proven. 435 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:37:42,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 22 proven. 435 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 10:37:43,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:43,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2018-11-07 10:37:43,375 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:43,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:37:43,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:37:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=2774, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 10:37:43,377 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 45 states. [2018-11-07 10:37:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:45,154 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-11-07 10:37:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:37:45,155 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2018-11-07 10:37:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:45,156 INFO L225 Difference]: With dead ends: 147 [2018-11-07 10:37:45,157 INFO L226 Difference]: Without dead ends: 145 [2018-11-07 10:37:45,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 220 SyntacticMatches, 13 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1262, Invalid=5710, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 10:37:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-07 10:37:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-11-07 10:37:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-07 10:37:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-11-07 10:37:45,168 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 129 [2018-11-07 10:37:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:45,169 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-11-07 10:37:45,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:37:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-11-07 10:37:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 10:37:45,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:45,171 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:45,171 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:45,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:45,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1445867854, now seen corresponding path program 23 times [2018-11-07 10:37:45,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:45,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:45,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:45,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 287 proven. 252 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 10:37:46,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:46,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:46,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:46,362 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:46,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:46,362 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:37:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:37:46,388 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:37:46,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 10:37:46,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:46,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 56 proven. 483 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 10:37:47,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 56 proven. 483 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 10:37:49,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:49,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 34] total 79 [2018-11-07 10:37:49,023 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:49,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:37:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:37:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=5338, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:37:49,024 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 50 states. [2018-11-07 10:37:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:50,124 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-11-07 10:37:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:37:50,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 137 [2018-11-07 10:37:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:50,126 INFO L225 Difference]: With dead ends: 205 [2018-11-07 10:37:50,127 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 10:37:50,128 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1136, Invalid=7794, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 10:37:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 10:37:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-07 10:37:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-07 10:37:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-11-07 10:37:50,139 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2018-11-07 10:37:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:50,139 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-11-07 10:37:50,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:37:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-11-07 10:37:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 10:37:50,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:50,141 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:50,141 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:50,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash -277400888, now seen corresponding path program 24 times [2018-11-07 10:37:50,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:50,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:50,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 205 proven. 362 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 10:37:50,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:50,613 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:50,613 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:50,613 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:50,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:50,613 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:37:50,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:37:50,622 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:37:50,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:37:50,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:37:50,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 23 proven. 544 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 10:37:51,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 23 proven. 544 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 10:37:51,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:51,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 64 [2018-11-07 10:37:51,864 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:51,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:37:51,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:37:51,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=3417, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 10:37:51,865 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 48 states. [2018-11-07 10:37:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:53,806 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-11-07 10:37:53,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 10:37:53,806 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-07 10:37:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:53,807 INFO L225 Difference]: With dead ends: 157 [2018-11-07 10:37:53,807 INFO L226 Difference]: Without dead ends: 155 [2018-11-07 10:37:53,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 233 SyntacticMatches, 16 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1460, Invalid=6912, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:37:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-07 10:37:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-11-07 10:37:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 10:37:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-11-07 10:37:53,818 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 139 [2018-11-07 10:37:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:53,819 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-11-07 10:37:53,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:37:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-11-07 10:37:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 10:37:53,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:53,820 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:53,821 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:53,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1416726283, now seen corresponding path program 25 times [2018-11-07 10:37:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:53,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:53,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:37:53,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:53,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 337 proven. 286 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 10:37:55,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:55,142 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:37:55,143 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:37:55,143 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:55,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:37:55,143 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:37:55,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:55,151 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:37:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:55,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:37:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 25 proven. 598 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 10:37:56,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:37:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 25 proven. 598 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 10:37:58,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:37:58,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 97 [2018-11-07 10:37:58,766 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:37:58,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 10:37:58,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 10:37:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=8134, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 10:37:58,768 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 66 states. [2018-11-07 10:38:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:01,639 INFO L93 Difference]: Finished difference Result 277 states and 282 transitions. [2018-11-07 10:38:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:38:01,640 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 147 [2018-11-07 10:38:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:01,642 INFO L225 Difference]: With dead ends: 277 [2018-11-07 10:38:01,642 INFO L226 Difference]: Without dead ends: 162 [2018-11-07 10:38:01,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 230 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1658, Invalid=11452, Unknown=0, NotChecked=0, Total=13110 [2018-11-07 10:38:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-07 10:38:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-11-07 10:38:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-07 10:38:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-11-07 10:38:01,654 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 147 [2018-11-07 10:38:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:01,655 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-11-07 10:38:01,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 10:38:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-11-07 10:38:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 10:38:01,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:01,656 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:01,656 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:01,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2144700411, now seen corresponding path program 26 times [2018-11-07 10:38:01,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:01,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:01,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 235 proven. 418 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 10:38:02,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:02,216 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:02,216 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:02,216 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:38:02,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:02,216 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:38:02,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:02,226 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:02,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 10:38:02,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:02,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 61 proven. 592 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 10:38:02,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 61 proven. 592 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 10:38:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 68 [2018-11-07 10:38:03,688 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:03,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:38:03,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:38:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=3849, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 10:38:03,689 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 51 states. [2018-11-07 10:38:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:05,314 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-11-07 10:38:05,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:38:05,315 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 149 [2018-11-07 10:38:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:05,317 INFO L225 Difference]: With dead ends: 167 [2018-11-07 10:38:05,317 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 10:38:05,318 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 250 SyntacticMatches, 17 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3152 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1696, Invalid=7810, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 10:38:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 10:38:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2018-11-07 10:38:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-07 10:38:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-11-07 10:38:05,330 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 149 [2018-11-07 10:38:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:05,330 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-11-07 10:38:05,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:38:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-11-07 10:38:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 10:38:05,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:05,331 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:05,332 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:05,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:05,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1214136136, now seen corresponding path program 27 times [2018-11-07 10:38:05,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:05,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:05,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:05,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:05,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 391 proven. 322 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 10:38:07,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:07,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:07,622 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:07,623 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:38:07,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:07,623 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:38:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:07,631 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:07,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:07,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:07,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 66 proven. 647 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 10:38:09,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 66 proven. 647 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 10:38:11,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:11,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 103 [2018-11-07 10:38:11,990 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:11,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 10:38:11,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 10:38:11,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=9192, Unknown=0, NotChecked=0, Total=10506 [2018-11-07 10:38:11,992 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 70 states. [2018-11-07 10:38:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:16,505 INFO L93 Difference]: Finished difference Result 295 states and 300 transitions. [2018-11-07 10:38:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:38:16,506 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 157 [2018-11-07 10:38:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:16,508 INFO L225 Difference]: With dead ends: 295 [2018-11-07 10:38:16,509 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 10:38:16,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 246 SyntacticMatches, 6 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4299 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1849, Invalid=12913, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 10:38:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 10:38:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2018-11-07 10:38:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 10:38:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-11-07 10:38:16,524 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 157 [2018-11-07 10:38:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:16,524 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-11-07 10:38:16,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 10:38:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-11-07 10:38:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 10:38:16,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:16,525 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:16,526 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:16,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:16,526 INFO L82 PathProgramCache]: Analyzing trace with hash -50217022, now seen corresponding path program 28 times [2018-11-07 10:38:16,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:16,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:16,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 267 proven. 478 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 10:38:17,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:17,440 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:17,440 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:17,440 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:38:17,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:17,440 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:38:17,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:17,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:17,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 28 proven. 678 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 10:38:18,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 28 proven. 678 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 10:38:19,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:19,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2018-11-07 10:38:19,225 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:19,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 10:38:19,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 10:38:19,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=4058, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 10:38:19,227 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 54 states. [2018-11-07 10:38:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:20,967 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-11-07 10:38:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 10:38:20,967 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 159 [2018-11-07 10:38:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:20,969 INFO L225 Difference]: With dead ends: 177 [2018-11-07 10:38:20,969 INFO L226 Difference]: Without dead ends: 175 [2018-11-07 10:38:20,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 271 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3355 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1862, Invalid=8440, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 10:38:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-07 10:38:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2018-11-07 10:38:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-07 10:38:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-11-07 10:38:20,983 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 159 [2018-11-07 10:38:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:20,983 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-11-07 10:38:20,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 10:38:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-11-07 10:38:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 10:38:20,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:20,985 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:20,985 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:20,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1870952965, now seen corresponding path program 29 times [2018-11-07 10:38:20,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:20,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:20,986 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 449 proven. 360 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 10:38:22,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:22,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:22,321 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:22,321 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:38:22,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:22,321 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:38:22,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:22,330 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:22,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 10:38:22,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:22,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 71 proven. 738 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 10:38:23,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 71 proven. 738 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 10:38:26,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41, 40] total 110 [2018-11-07 10:38:26,304 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:26,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 10:38:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 10:38:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10476, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:38:26,307 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 75 states. [2018-11-07 10:38:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:28,810 INFO L93 Difference]: Finished difference Result 247 states and 265 transitions. [2018-11-07 10:38:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 10:38:28,811 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 167 [2018-11-07 10:38:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:28,813 INFO L225 Difference]: With dead ends: 247 [2018-11-07 10:38:28,813 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 10:38:28,815 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 262 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6855 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2011, Invalid=15019, Unknown=0, NotChecked=0, Total=17030 [2018-11-07 10:38:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 10:38:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-11-07 10:38:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-07 10:38:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-11-07 10:38:28,829 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2018-11-07 10:38:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:28,830 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-11-07 10:38:28,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 10:38:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-11-07 10:38:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 10:38:28,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:28,831 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:28,832 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:28,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1120217599, now seen corresponding path program 30 times [2018-11-07 10:38:28,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:28,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:28,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 301 proven. 542 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 10:38:30,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:30,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:30,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:30,178 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:38:30,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:30,178 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:30,186 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:30,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:30,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:30,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 29 proven. 814 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 10:38:31,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 29 proven. 814 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 10:38:32,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:32,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39, 39] total 76 [2018-11-07 10:38:32,677 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:32,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 10:38:32,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 10:38:32,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=4830, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 10:38:32,679 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 57 states. [2018-11-07 10:38:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:34,472 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-11-07 10:38:34,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:38:34,472 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 169 [2018-11-07 10:38:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:34,474 INFO L225 Difference]: With dead ends: 187 [2018-11-07 10:38:34,475 INFO L226 Difference]: Without dead ends: 185 [2018-11-07 10:38:34,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 284 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4017 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2099, Invalid=9891, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:38:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-07 10:38:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2018-11-07 10:38:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-07 10:38:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-11-07 10:38:34,488 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 169 [2018-11-07 10:38:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:34,489 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-11-07 10:38:34,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 10:38:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-11-07 10:38:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-07 10:38:34,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:34,490 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:34,490 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:34,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash -326346942, now seen corresponding path program 31 times [2018-11-07 10:38:34,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:34,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:34,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:34,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 511 proven. 400 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 10:38:36,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:36,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:36,506 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:36,507 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:38:36,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:36,507 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:36,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:36,517 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:36,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 31 proven. 880 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 10:38:38,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 31 proven. 880 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 10:38:42,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:42,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 115 [2018-11-07 10:38:42,051 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:42,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-07 10:38:42,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-07 10:38:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=11458, Unknown=0, NotChecked=0, Total=13110 [2018-11-07 10:38:42,054 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 78 states. [2018-11-07 10:38:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:45,445 INFO L93 Difference]: Finished difference Result 331 states and 336 transitions. [2018-11-07 10:38:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 10:38:45,445 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 177 [2018-11-07 10:38:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:45,447 INFO L225 Difference]: With dead ends: 331 [2018-11-07 10:38:45,447 INFO L226 Difference]: Without dead ends: 192 [2018-11-07 10:38:45,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 278 SyntacticMatches, 6 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5405 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2306, Invalid=16054, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 10:38:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-07 10:38:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2018-11-07 10:38:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-07 10:38:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-11-07 10:38:45,462 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 177 [2018-11-07 10:38:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:45,463 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-11-07 10:38:45,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-07 10:38:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-11-07 10:38:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 10:38:45,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:45,464 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:45,464 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:45,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1834276540, now seen corresponding path program 32 times [2018-11-07 10:38:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:45,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 337 proven. 610 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 10:38:47,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:47,182 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:47,182 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:47,182 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:38:47,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:47,182 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:47,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:38:47,191 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:38:47,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-07 10:38:47,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:47,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 76 proven. 871 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 10:38:47,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 76 proven. 871 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 10:38:49,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41, 41] total 80 [2018-11-07 10:38:49,052 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:49,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 10:38:49,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 10:38:49,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=5340, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:38:49,053 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 60 states. [2018-11-07 10:38:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:51,054 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-11-07 10:38:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:38:51,054 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 179 [2018-11-07 10:38:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:51,056 INFO L225 Difference]: With dead ends: 197 [2018-11-07 10:38:51,056 INFO L226 Difference]: Without dead ends: 195 [2018-11-07 10:38:51,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 301 SyntacticMatches, 20 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4487 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2383, Invalid=10957, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 10:38:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-07 10:38:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2018-11-07 10:38:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-07 10:38:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-11-07 10:38:51,072 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 179 [2018-11-07 10:38:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:51,072 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-11-07 10:38:51,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 10:38:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-11-07 10:38:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-07 10:38:51,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:51,074 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:51,074 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:51,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1992952065, now seen corresponding path program 33 times [2018-11-07 10:38:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:51,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:38:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:51,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 577 proven. 442 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 10:38:52,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:52,974 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:52,974 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:38:52,974 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:38:52,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:52,974 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:52,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:38:52,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:38:53,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:38:53,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:38:53,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 81 proven. 938 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 10:38:55,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 81 proven. 938 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 10:38:58,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:58,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 121 [2018-11-07 10:38:58,703 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:58,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-11-07 10:38:58,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-11-07 10:38:58,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1812, Invalid=12708, Unknown=0, NotChecked=0, Total=14520 [2018-11-07 10:38:58,704 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 82 states. [2018-11-07 10:39:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:02,715 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-11-07 10:39:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:39:02,722 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 187 [2018-11-07 10:39:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:02,723 INFO L225 Difference]: With dead ends: 349 [2018-11-07 10:39:02,723 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 10:39:02,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 294 SyntacticMatches, 6 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5964 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2530, Invalid=17776, Unknown=0, NotChecked=0, Total=20306 [2018-11-07 10:39:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 10:39:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2018-11-07 10:39:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-07 10:39:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-11-07 10:39:02,739 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 187 [2018-11-07 10:39:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:02,739 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-11-07 10:39:02,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-11-07 10:39:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-11-07 10:39:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 10:39:02,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:02,740 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:02,741 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:02,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 430499321, now seen corresponding path program 34 times [2018-11-07 10:39:02,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:02,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:02,742 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 375 proven. 682 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 10:39:03,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:03,473 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:03,474 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:03,474 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:39:03,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:03,474 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:03,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:03,483 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:03,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 34 proven. 975 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 10:39:04,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 34 proven. 975 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 10:39:05,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:05,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2018-11-07 10:39:05,738 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:05,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 10:39:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 10:39:05,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=5585, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 10:39:05,740 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 63 states. [2018-11-07 10:39:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:07,940 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-11-07 10:39:07,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 10:39:07,940 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 189 [2018-11-07 10:39:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:07,942 INFO L225 Difference]: With dead ends: 207 [2018-11-07 10:39:07,942 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 10:39:07,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 322 SyntacticMatches, 19 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4726 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2579, Invalid=11701, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 10:39:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 10:39:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-11-07 10:39:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-07 10:39:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-11-07 10:39:07,956 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 189 [2018-11-07 10:39:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:07,957 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-11-07 10:39:07,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 10:39:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-11-07 10:39:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 10:39:07,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:07,958 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:07,958 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:07,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:07,959 INFO L82 PathProgramCache]: Analyzing trace with hash -128353988, now seen corresponding path program 35 times [2018-11-07 10:39:07,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:07,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:07,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 647 proven. 486 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 10:39:09,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:09,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:09,661 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:09,661 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:39:09,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:09,662 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:09,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:39:09,670 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:39:09,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 10:39:09,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:09,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 86 proven. 1047 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 10:39:11,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 86 proven. 1047 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 10:39:14,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:14,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 46] total 128 [2018-11-07 10:39:14,877 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:14,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-07 10:39:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-07 10:39:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14184, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 10:39:14,879 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 87 states. [2018-11-07 10:39:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:18,173 INFO L93 Difference]: Finished difference Result 289 states and 310 transitions. [2018-11-07 10:39:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 10:39:18,173 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 197 [2018-11-07 10:39:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:18,175 INFO L225 Difference]: With dead ends: 289 [2018-11-07 10:39:18,175 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 10:39:18,177 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 310 SyntacticMatches, 5 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2713, Invalid=20239, Unknown=0, NotChecked=0, Total=22952 [2018-11-07 10:39:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 10:39:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-11-07 10:39:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-07 10:39:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-11-07 10:39:18,191 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 197 [2018-11-07 10:39:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:18,191 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-11-07 10:39:18,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-07 10:39:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-11-07 10:39:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 10:39:18,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:18,192 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:18,193 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:18,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 668039094, now seen corresponding path program 36 times [2018-11-07 10:39:18,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:18,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:18,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:18,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 415 proven. 758 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 10:39:19,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:19,499 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:19,499 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:19,499 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:39:19,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:19,499 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:19,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:19,510 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:19,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:19,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:19,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 35 proven. 1138 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 10:39:21,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 35 proven. 1138 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 10:39:22,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:22,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45, 45] total 88 [2018-11-07 10:39:22,610 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:22,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 10:39:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 10:39:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1170, Invalid=6486, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 10:39:22,611 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 66 states. [2018-11-07 10:39:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:24,875 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-11-07 10:39:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 10:39:24,875 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-07 10:39:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:24,877 INFO L225 Difference]: With dead ends: 217 [2018-11-07 10:39:24,877 INFO L226 Difference]: Without dead ends: 215 [2018-11-07 10:39:24,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 335 SyntacticMatches, 22 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2855, Invalid=13401, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 10:39:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-07 10:39:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2018-11-07 10:39:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 10:39:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-11-07 10:39:24,890 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 199 [2018-11-07 10:39:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:24,890 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-11-07 10:39:24,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 10:39:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-11-07 10:39:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 10:39:24,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:24,892 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:24,892 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:24,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1746469383, now seen corresponding path program 37 times [2018-11-07 10:39:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:24,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:24,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:24,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 721 proven. 532 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 10:39:27,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:27,700 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:27,701 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:27,701 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:39:27,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:27,701 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:27,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:27,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:39:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:27,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 37 proven. 1216 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 10:39:30,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 37 proven. 1216 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 10:39:34,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:34,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 133 [2018-11-07 10:39:34,536 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:34,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-07 10:39:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-07 10:39:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2207, Invalid=15349, Unknown=0, NotChecked=0, Total=17556 [2018-11-07 10:39:34,538 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 90 states. [2018-11-07 10:39:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:39,510 INFO L93 Difference]: Finished difference Result 385 states and 390 transitions. [2018-11-07 10:39:39,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 10:39:39,511 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 207 [2018-11-07 10:39:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:39,513 INFO L225 Difference]: With dead ends: 385 [2018-11-07 10:39:39,513 INFO L226 Difference]: Without dead ends: 222 [2018-11-07 10:39:39,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 326 SyntacticMatches, 6 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7256 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3062, Invalid=21430, Unknown=0, NotChecked=0, Total=24492 [2018-11-07 10:39:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-07 10:39:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 212. [2018-11-07 10:39:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-07 10:39:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-11-07 10:39:39,531 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 207 [2018-11-07 10:39:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:39,531 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-11-07 10:39:39,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-11-07 10:39:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-11-07 10:39:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 10:39:39,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:39,533 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:39,533 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:39,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash -50942989, now seen corresponding path program 38 times [2018-11-07 10:39:39,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:39,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:39,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:39:39,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:39,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1925 backedges. 457 proven. 838 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 10:39:40,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:40,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:40,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:40,308 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:39:40,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:40,309 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:40,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:39:40,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:39:40,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-07 10:39:40,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:40,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1925 backedges. 91 proven. 1204 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 10:39:42,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1925 backedges. 91 proven. 1204 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 10:39:43,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:43,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2018-11-07 10:39:43,465 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:43,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 10:39:43,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 10:39:43,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1298, Invalid=7074, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:39:43,467 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 69 states. [2018-11-07 10:39:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:39:45,871 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-11-07 10:39:45,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 10:39:45,871 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 209 [2018-11-07 10:39:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:39:45,873 INFO L225 Difference]: With dead ends: 227 [2018-11-07 10:39:45,873 INFO L226 Difference]: Without dead ends: 225 [2018-11-07 10:39:45,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 352 SyntacticMatches, 23 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6056 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3187, Invalid=14635, Unknown=0, NotChecked=0, Total=17822 [2018-11-07 10:39:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-07 10:39:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-11-07 10:39:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-07 10:39:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-11-07 10:39:45,891 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 209 [2018-11-07 10:39:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:39:45,891 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-11-07 10:39:45,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 10:39:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-11-07 10:39:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 10:39:45,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:39:45,893 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:39:45,893 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:39:45,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:39:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1293507274, now seen corresponding path program 39 times [2018-11-07 10:39:45,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:39:45,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:45,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:39:45,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:39:45,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:39:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:39:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 799 proven. 580 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 10:39:48,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:48,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:39:48,213 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:39:48,213 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:39:48,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:39:48,213 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:39:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:39:48,222 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:39:48,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:39:48,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:39:48,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:39:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 96 proven. 1283 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 10:39:51,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:39:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 96 proven. 1283 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 10:39:56,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:39:56,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 139 [2018-11-07 10:39:56,142 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:39:56,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-11-07 10:39:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-11-07 10:39:56,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2391, Invalid=16791, Unknown=0, NotChecked=0, Total=19182 [2018-11-07 10:39:56,144 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 94 states. [2018-11-07 10:40:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:01,199 INFO L93 Difference]: Finished difference Result 403 states and 408 transitions. [2018-11-07 10:40:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 10:40:01,200 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 217 [2018-11-07 10:40:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:01,202 INFO L225 Difference]: With dead ends: 403 [2018-11-07 10:40:01,202 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 10:40:01,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 342 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3319, Invalid=23413, Unknown=0, NotChecked=0, Total=26732 [2018-11-07 10:40:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 10:40:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2018-11-07 10:40:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 10:40:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-11-07 10:40:01,225 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 217 [2018-11-07 10:40:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:01,225 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-11-07 10:40:01,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-11-07 10:40:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-11-07 10:40:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 10:40:01,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:01,227 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:01,227 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:01,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1163436720, now seen corresponding path program 40 times [2018-11-07 10:40:01,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:01,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:01,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:01,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:01,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 501 proven. 922 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 10:40:02,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:02,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:02,309 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:02,309 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:40:02,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:02,309 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:02,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:02,318 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:02,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 40 proven. 1326 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 10:40:03,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 40 proven. 1326 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 10:40:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:04,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2018-11-07 10:40:04,817 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:04,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-07 10:40:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-07 10:40:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=7355, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 10:40:04,818 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 72 states. [2018-11-07 10:40:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:07,860 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-11-07 10:40:07,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 10:40:07,861 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 219 [2018-11-07 10:40:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:07,863 INFO L225 Difference]: With dead ends: 237 [2018-11-07 10:40:07,863 INFO L226 Difference]: Without dead ends: 235 [2018-11-07 10:40:07,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 373 SyntacticMatches, 22 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6331 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3413, Invalid=15493, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 10:40:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-07 10:40:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2018-11-07 10:40:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-07 10:40:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-11-07 10:40:07,880 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 219 [2018-11-07 10:40:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:07,881 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-11-07 10:40:07,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-07 10:40:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-11-07 10:40:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 10:40:07,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:07,882 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:07,883 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:07,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1131974387, now seen corresponding path program 41 times [2018-11-07 10:40:07,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:07,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:07,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:07,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 881 proven. 630 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 10:40:10,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:10,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:10,246 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:10,246 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:40:10,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:10,246 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:10,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:40:10,255 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:40:10,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 10:40:10,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:10,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 101 proven. 1410 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 10:40:11,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 101 proven. 1410 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 10:40:15,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:15,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 53, 52] total 124 [2018-11-07 10:40:15,621 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:15,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-07 10:40:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-07 10:40:15,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2057, Invalid=13195, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 10:40:15,623 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 77 states. [2018-11-07 10:40:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:19,330 INFO L93 Difference]: Finished difference Result 331 states and 355 transitions. [2018-11-07 10:40:19,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-07 10:40:19,331 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 227 [2018-11-07 10:40:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:19,333 INFO L225 Difference]: With dead ends: 331 [2018-11-07 10:40:19,333 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 10:40:19,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 380 SyntacticMatches, 5 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7605 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2765, Invalid=19287, Unknown=0, NotChecked=0, Total=22052 [2018-11-07 10:40:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 10:40:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-11-07 10:40:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-07 10:40:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2018-11-07 10:40:19,356 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 227 [2018-11-07 10:40:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:19,356 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2018-11-07 10:40:19,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-07 10:40:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2018-11-07 10:40:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-07 10:40:19,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:19,358 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:19,358 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:19,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:19,358 INFO L82 PathProgramCache]: Analyzing trace with hash 911178733, now seen corresponding path program 42 times [2018-11-07 10:40:19,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:19,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:19,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 547 proven. 1010 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 10:40:20,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:20,501 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:20,501 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:40:20,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:20,501 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:20,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:40:20,511 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:40:20,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:40:20,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:40:20,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:40:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 41 proven. 1516 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 10:40:21,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:40:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 41 proven. 1516 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 10:40:23,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:40:23,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51, 51] total 100 [2018-11-07 10:40:23,651 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:40:23,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 10:40:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 10:40:23,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=8385, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 10:40:23,652 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 75 states. [2018-11-07 10:40:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:40:26,663 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-11-07 10:40:26,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 10:40:26,664 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 229 [2018-11-07 10:40:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:40:26,666 INFO L225 Difference]: With dead ends: 247 [2018-11-07 10:40:26,666 INFO L226 Difference]: Without dead ends: 245 [2018-11-07 10:40:26,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 386 SyntacticMatches, 25 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7233 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3728, Invalid=17442, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 10:40:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-07 10:40:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2018-11-07 10:40:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-07 10:40:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-11-07 10:40:26,686 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 229 [2018-11-07 10:40:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:40:26,686 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-11-07 10:40:26,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 10:40:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-11-07 10:40:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 10:40:26,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:40:26,688 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:40:26,688 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:40:26,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:40:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash 886364976, now seen corresponding path program 43 times [2018-11-07 10:40:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:40:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:26,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:40:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:40:26,690 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:40:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 967 proven. 682 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-07 10:40:29,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:29,565 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:40:29,565 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:40:29,565 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:40:29,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:40:29,566 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:40:29,577 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:40:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:40:29,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-11-07 10:40:32,320 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 10:40:32,521 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:40:32,521 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:40:32,527 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:40:32,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:40:32 BoogieIcfgContainer [2018-11-07 10:40:32,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:40:32,528 INFO L168 Benchmark]: Toolchain (without parser) took 237325.37 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 770.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -494.1 MB). Peak memory consumption was 276.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:32,529 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:32,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.15 ms. Allocated memory is still 1.6 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:40:32,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.60 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:32,531 INFO L168 Benchmark]: Boogie Preprocessor took 27.10 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:40:32,531 INFO L168 Benchmark]: RCFGBuilder took 477.43 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:32,532 INFO L168 Benchmark]: TraceAbstraction took 236514.53 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 22.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.5 MB). Peak memory consumption was 317.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:40:32,535 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.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 272.15 ms. Allocated memory is still 1.6 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 23.60 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.10 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 477.43 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236514.53 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 22.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.5 MB). Peak memory consumption was 317.1 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 238 with TraceHistMax 24,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 84 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. TIMEOUT Result, 236.4s OverallTime, 47 OverallIterations, 24 TraceHistogramMax, 81.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1508 SDtfs, 6571 SDslu, 42839 SDs, 0 SdLazy, 64097 SolverSat, 6199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13086 GetRequests, 8817 SyntacticMatches, 425 SemanticMatches, 3844 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136504 ImplicationChecksByTransitivity, 159.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 240 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 142.1s InterpolantComputationTime, 10853 NumberOfCodeBlocks, 10853 NumberOfCodeBlocksAsserted, 281 NumberOfCheckSat, 16131 ConstructedInterpolants, 0 QuantifiedInterpolants, 19443847 SizeOfPredicates, 233 NumberOfNonLiveVariables, 11594 ConjunctsInSsa, 2249 ConjunctsInUnsatCore, 134 InterpolantComputations, 2 PerfectInterpolantSequences, 47728/106788 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown