java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/avg40-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:27:25,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:27:25,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:27:25,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:27:25,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:27:25,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:27:25,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:27:25,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:27:25,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:27:25,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:27:25,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:27:25,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:27:25,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:27:25,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:27:25,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:27:25,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:27:25,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:27:25,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:27:25,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:27:25,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:27:25,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:27:25,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:27:25,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:27:25,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:27:25,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:27:25,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:27:25,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:27:25,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:27:25,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:27:25,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:27:25,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:27:25,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:27:25,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:27:25,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:27:25,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:27:25,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:27:25,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:27:25,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:27:25,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:27:25,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:27:25,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:27:25,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:27:25,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:27:25,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:27:25,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:27:25,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:27:25,579 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:27:25,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:27:25,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:27:25,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:27:25,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:27:25,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:27:25,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:27:25,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:27:25,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:27:25,581 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:27:25,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:27:25,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:27:25,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:27:25,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:27:25,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:27:25,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:27:25,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:27:25,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:25,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:27:25,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:27:25,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:27:25,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:27:25,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:27:25,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:27:25,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:27:25,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:27:25,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:27:25,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:27:25,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:27:25,645 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:27:25,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg40-2.i [2019-10-02 14:27:25,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4173c3f39/cdf45264b11942689860d931551736cd/FLAGec2ada243 [2019-10-02 14:27:26,206 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:27:26,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg40-2.i [2019-10-02 14:27:26,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4173c3f39/cdf45264b11942689860d931551736cd/FLAGec2ada243 [2019-10-02 14:27:26,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4173c3f39/cdf45264b11942689860d931551736cd [2019-10-02 14:27:26,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:27:26,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:27:26,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:26,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:27:26,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:27:26,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:26" (1/1) ... [2019-10-02 14:27:26,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409c6ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:26, skipping insertion in model container [2019-10-02 14:27:26,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:26" (1/1) ... [2019-10-02 14:27:26,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:27:26,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:26,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:26,925 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:26,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:27,050 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:27,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27 WrapperNode [2019-10-02 14:27:27,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:27,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:27,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:27,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:27,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (1/1) ... [2019-10-02 14:27:27,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (1/1) ... [2019-10-02 14:27:27,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (1/1) ... [2019-10-02 14:27:27,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (1/1) ... [2019-10-02 14:27:27,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (1/1) ... [2019-10-02 14:27:27,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (1/1) ... [2019-10-02 14:27:27,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (1/1) ... [2019-10-02 14:27:27,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:27,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:27,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:27,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:27,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (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 [2019-10-02 14:27:27,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:27,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:27,153 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2019-10-02 14:27:27,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:27,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:27,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2019-10-02 14:27:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:27:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:27:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:27:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:27:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:27,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:27,467 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:27,468 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 14:27:27,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:27 BoogieIcfgContainer [2019-10-02 14:27:27,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:27,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:27,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:27,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:27,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:27:26" (1/3) ... [2019-10-02 14:27:27,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1531146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:27, skipping insertion in model container [2019-10-02 14:27:27,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:27" (2/3) ... [2019-10-02 14:27:27,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1531146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:27, skipping insertion in model container [2019-10-02 14:27:27,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:27" (3/3) ... [2019-10-02 14:27:27,477 INFO L109 eAbstractionObserver]: Analyzing ICFG avg40-2.i [2019-10-02 14:27:27,488 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:27,495 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:27,512 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:27,538 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:27,539 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:27,539 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:27,539 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:27,539 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:27,539 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:27,539 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:27,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:27,539 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-02 14:27:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:27:27,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:27,564 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:27,566 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-10-02 14:27:27,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:27,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:27,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:27:27,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:27,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:27:27,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:27:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:27:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:27,761 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-02 14:27:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:27,783 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-02 14:27:27,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:27:27,785 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-02 14:27:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:27,794 INFO L225 Difference]: With dead ends: 54 [2019-10-02 14:27:27,795 INFO L226 Difference]: Without dead ends: 26 [2019-10-02 14:27:27,799 INFO L640 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 [2019-10-02 14:27:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-02 14:27:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-02 14:27:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-02 14:27:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-02 14:27:27,842 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-02 14:27:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:27,842 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-02 14:27:27,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:27:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-02 14:27:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:27:27,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:27,846 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:27,846 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-10-02 14:27:27,847 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:27,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:27,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:27,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:27,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:27:27,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:27,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:27,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:27,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:27,944 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-02 14:27:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:27,979 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-02 14:27:27,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:27,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:27:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:27,982 INFO L225 Difference]: With dead ends: 46 [2019-10-02 14:27:27,982 INFO L226 Difference]: Without dead ends: 28 [2019-10-02 14:27:27,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-02 14:27:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-02 14:27:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 14:27:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-02 14:27:27,998 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-02 14:27:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:27,999 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-02 14:27:27,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-02 14:27:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:27:28,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:28,001 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:28,001 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-10-02 14:27:28,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:28,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:28,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:27:28,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:28,082 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:28,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:28,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:27:28,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 14:27:28,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:27:28,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 14:27:28,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:28,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:28,226 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-02 14:27:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:28,253 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-02 14:27:28,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:28,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-02 14:27:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:28,255 INFO L225 Difference]: With dead ends: 46 [2019-10-02 14:27:28,255 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 14:27:28,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 14:27:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-02 14:27:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 14:27:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-02 14:27:28,268 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-02 14:27:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:28,268 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-02 14:27:28,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-02 14:27:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 14:27:28,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:28,272 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:28,273 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-10-02 14:27:28,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:28,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:28,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 14:27:28,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:28,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:28,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:28,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:28,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:28,425 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-02 14:27:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:28,450 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-02 14:27:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:28,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-02 14:27:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:28,454 INFO L225 Difference]: With dead ends: 43 [2019-10-02 14:27:28,454 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 14:27:28,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 14:27:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-02 14:27:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 14:27:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-02 14:27:28,470 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-02 14:27:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:28,474 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-02 14:27:28,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-02 14:27:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 14:27:28,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:28,479 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:28,479 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-10-02 14:27:28,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:28,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:28,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:28,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 14:27:28,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:28,634 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:28,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:28,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 14:27:28,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:28,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:27:28,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:28,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:28,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:28,750 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-02 14:27:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:28,785 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-02 14:27:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:27:28,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-02 14:27:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:28,787 INFO L225 Difference]: With dead ends: 52 [2019-10-02 14:27:28,787 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 14:27:28,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 14:27:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-02 14:27:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 14:27:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-02 14:27:28,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-02 14:27:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:28,794 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-02 14:27:28,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-02 14:27:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 14:27:28,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:28,795 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:28,796 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:28,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:28,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-10-02 14:27:28,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:28,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 14:27:28,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:28,872 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 14:27:28,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:28,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:28,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:28,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:28,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 14:27:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:27:28,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:27:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:27:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:28,988 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-02 14:27:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:29,024 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-02 14:27:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:29,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-02 14:27:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:29,026 INFO L225 Difference]: With dead ends: 54 [2019-10-02 14:27:29,026 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 14:27:29,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 14:27:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-02 14:27:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 14:27:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-02 14:27:29,032 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-02 14:27:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:29,033 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-02 14:27:29,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:27:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-02 14:27:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 14:27:29,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:29,034 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:29,035 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2019-10-02 14:27:29,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:29,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:29,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 14:27:29,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:29,170 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 14:27:29,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:29,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 14:27:29,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:29,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:29,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 14:27:29,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:29,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 14:27:29,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:29,283 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-02 14:27:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:29,342 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-02 14:27:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:27:29,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-02 14:27:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:29,343 INFO L225 Difference]: With dead ends: 59 [2019-10-02 14:27:29,343 INFO L226 Difference]: Without dead ends: 39 [2019-10-02 14:27:29,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-02 14:27:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-02 14:27:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 14:27:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-02 14:27:29,355 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-02 14:27:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:29,355 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-02 14:27:29,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-02 14:27:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 14:27:29,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:29,360 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:29,361 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2019-10-02 14:27:29,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:29,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:27:29,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:29,483 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:29,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:29,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:29,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:27:29,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:27:29,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:29,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 14:27:29,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:29,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:29,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:29,610 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-02 14:27:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:29,670 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-02 14:27:29,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 14:27:29,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-02 14:27:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:29,672 INFO L225 Difference]: With dead ends: 62 [2019-10-02 14:27:29,672 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 14:27:29,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 14:27:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-02 14:27:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 14:27:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-02 14:27:29,683 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-02 14:27:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:29,683 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-02 14:27:29,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-02 14:27:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:27:29,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:29,685 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:29,685 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2019-10-02 14:27:29,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:29,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:29,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:29,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:27:29,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:29,776 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:29,801 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:27:29,880 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 14:27:29,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:29,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:29,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 14:27:29,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:29,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 14:27:29,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:29,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:29,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:29,938 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-02 14:27:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:29,998 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-02 14:27:29,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:29,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-02 14:27:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:29,999 INFO L225 Difference]: With dead ends: 67 [2019-10-02 14:27:29,999 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 14:27:30,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 14:27:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-02 14:27:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 14:27:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-02 14:27:30,006 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-02 14:27:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:30,006 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-02 14:27:30,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-02 14:27:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 14:27:30,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:30,008 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:30,008 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2019-10-02 14:27:30,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:30,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 14:27:30,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:30,094 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 14:27:30,115 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:30,163 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 14:27:30,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:30,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:30,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:27:30,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:30,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-02 14:27:30,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:30,201 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-02 14:27:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:30,262 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-02 14:27:30,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:30,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-02 14:27:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:30,264 INFO L225 Difference]: With dead ends: 73 [2019-10-02 14:27:30,264 INFO L226 Difference]: Without dead ends: 49 [2019-10-02 14:27:30,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-02 14:27:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-02 14:27:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 14:27:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-02 14:27:30,275 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-02 14:27:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:30,276 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-02 14:27:30,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-02 14:27:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:27:30,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:30,281 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:30,281 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2019-10-02 14:27:30,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:30,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:30,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 14:27:30,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:30,402 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:30,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:30,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:27:30,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 14:27:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:30,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:27:30,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:30,526 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-02 14:27:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:30,572 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-02 14:27:30,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:30,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-02 14:27:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:30,574 INFO L225 Difference]: With dead ends: 76 [2019-10-02 14:27:30,574 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 14:27:30,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 14:27:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-02 14:27:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 14:27:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-02 14:27:30,587 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-02 14:27:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:30,587 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-02 14:27:30,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-02 14:27:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 14:27:30,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:30,591 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:30,591 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:30,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2019-10-02 14:27:30,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:30,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 14:27:30,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:30,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:30,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:30,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:30,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:27:30,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 14:27:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:30,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:27:30,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:27:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:27:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:27:30,835 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-02 14:27:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:30,874 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-02 14:27:30,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:30,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-02 14:27:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:30,876 INFO L225 Difference]: With dead ends: 78 [2019-10-02 14:27:30,876 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 14:27:30,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:27:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 14:27:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-02 14:27:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 14:27:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-02 14:27:30,883 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-02 14:27:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:30,883 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-02 14:27:30,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:27:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-02 14:27:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 14:27:30,884 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:30,884 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:30,885 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2019-10-02 14:27:30,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 14:27:31,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:31,000 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:31,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:31,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 14:27:31,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:31,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:31,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-02 14:27:31,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:31,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 14:27:31,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:27:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:27:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:27:31,132 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-02 14:27:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:31,196 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-02 14:27:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:27:31,196 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-02 14:27:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:31,197 INFO L225 Difference]: With dead ends: 83 [2019-10-02 14:27:31,198 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 14:27:31,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:27:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 14:27:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-02 14:27:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 14:27:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-02 14:27:31,204 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-02 14:27:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:31,205 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-02 14:27:31,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:27:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-02 14:27:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 14:27:31,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:31,206 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:31,206 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2019-10-02 14:27:31,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:31,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:31,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-02 14:27:31,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:31,342 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 14:27:31,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:31,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:31,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:31,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:27:31,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:31,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:31,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-02 14:27:31,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:27:31,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:27:31,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:27:31,532 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-02 14:27:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:31,615 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-02 14:27:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:27:31,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-02 14:27:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:31,616 INFO L225 Difference]: With dead ends: 89 [2019-10-02 14:27:31,617 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 14:27:31,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:27:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 14:27:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-02 14:27:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 14:27:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-02 14:27:31,625 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-02 14:27:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:31,626 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-02 14:27:31,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:27:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-02 14:27:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 14:27:31,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:31,627 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:31,627 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:31,628 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2019-10-02 14:27:31,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:31,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:31,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:31,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:31,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 14:27:31,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:31,767 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 14:27:31,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:32,030 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 14:27:32,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:32,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:27:32,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-02 14:27:32,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:32,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-02 14:27:32,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:27:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:27:32,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:27:32,106 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-02 14:27:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:32,183 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-02 14:27:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:27:32,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-02 14:27:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:32,184 INFO L225 Difference]: With dead ends: 95 [2019-10-02 14:27:32,184 INFO L226 Difference]: Without dead ends: 65 [2019-10-02 14:27:32,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:27:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-02 14:27:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-02 14:27:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 14:27:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-02 14:27:32,190 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-02 14:27:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:32,191 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-02 14:27:32,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:27:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-02 14:27:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 14:27:32,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:32,192 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:32,192 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2019-10-02 14:27:32,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:32,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-02 14:27:32,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:32,355 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:32,384 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:27:32,576 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 14:27:32,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:32,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:27:32,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-02 14:27:32,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:32,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-02 14:27:32,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:27:32,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:27:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:27:32,668 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-02 14:27:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:32,800 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-02 14:27:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:27:32,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-02 14:27:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:32,802 INFO L225 Difference]: With dead ends: 101 [2019-10-02 14:27:32,802 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 14:27:32,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:27:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 14:27:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-02 14:27:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 14:27:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-02 14:27:32,809 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-02 14:27:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:32,809 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-02 14:27:32,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:27:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-02 14:27:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 14:27:32,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:32,811 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:32,811 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2019-10-02 14:27:32,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:32,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:32,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:32,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-02 14:27:33,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:33,009 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:33,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:33,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:27:33,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-02 14:27:33,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:33,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 14:27:33,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:27:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:27:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:27:33,133 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-02 14:27:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:33,189 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-02 14:27:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:27:33,192 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-02 14:27:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:33,193 INFO L225 Difference]: With dead ends: 104 [2019-10-02 14:27:33,193 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 14:27:33,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:27:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 14:27:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-02 14:27:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-02 14:27:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-02 14:27:33,204 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-02 14:27:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:33,204 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-02 14:27:33,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:27:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-02 14:27:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 14:27:33,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:33,206 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:33,206 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:33,206 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2019-10-02 14:27:33,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:33,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-02 14:27:33,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:33,384 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:33,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:33,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:33,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:33,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:27:33,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-02 14:27:33,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:33,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 14:27:33,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:27:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:27:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:27:33,515 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-02 14:27:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:33,572 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-02 14:27:33,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:27:33,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-02 14:27:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:33,573 INFO L225 Difference]: With dead ends: 106 [2019-10-02 14:27:33,573 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 14:27:33,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:27:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 14:27:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-02 14:27:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 14:27:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-02 14:27:33,579 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-02 14:27:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:33,579 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-02 14:27:33,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:27:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-02 14:27:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 14:27:33,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:33,580 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:33,580 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2019-10-02 14:27:33,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:33,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:33,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:33,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-02 14:27:33,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:33,781 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 14:27:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:33,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 14:27:33,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:33,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:27:33,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-02 14:27:34,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:34,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-02 14:27:34,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:27:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:27:34,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:27:34,016 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-02 14:27:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:34,132 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-02 14:27:34,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:27:34,133 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-02 14:27:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:34,134 INFO L225 Difference]: With dead ends: 111 [2019-10-02 14:27:34,134 INFO L226 Difference]: Without dead ends: 77 [2019-10-02 14:27:34,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:27:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-02 14:27:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-02 14:27:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 14:27:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-02 14:27:34,139 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-02 14:27:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:34,140 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-02 14:27:34,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:27:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-02 14:27:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 14:27:34,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:34,142 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:34,142 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2019-10-02 14:27:34,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:34,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:34,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-02 14:27:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:34,362 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:34,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:34,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:34,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:34,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:27:34,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-02 14:27:34,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:34,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 14:27:34,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:27:34,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:27:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:27:34,501 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-02 14:27:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:34,563 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-02 14:27:34,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:27:34,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-02 14:27:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:34,565 INFO L225 Difference]: With dead ends: 114 [2019-10-02 14:27:34,565 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 14:27:34,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:27:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 14:27:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-02 14:27:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 14:27:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-02 14:27:34,569 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-02 14:27:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:34,570 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-02 14:27:34,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:27:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-02 14:27:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 14:27:34,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:34,571 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:34,571 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2019-10-02 14:27:34,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:34,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:34,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-02 14:27:34,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:34,874 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:34,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:27:36,096 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-02 14:27:36,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:36,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:27:36,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-02 14:27:36,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:36,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-02 14:27:36,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:27:36,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:27:36,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:27:36,481 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-02 14:27:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:36,616 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-02 14:27:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:27:36,616 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-02 14:27:36,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:36,617 INFO L225 Difference]: With dead ends: 119 [2019-10-02 14:27:36,618 INFO L226 Difference]: Without dead ends: 83 [2019-10-02 14:27:36,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:27:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-02 14:27:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-02 14:27:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-02 14:27:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-02 14:27:36,623 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-02 14:27:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:36,623 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-02 14:27:36,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:27:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-02 14:27:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 14:27:36,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:36,625 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:36,625 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:36,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2019-10-02 14:27:36,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:36,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:36,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:36,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:36,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-02 14:27:36,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:36,869 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:36,895 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:27:37,121 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-02 14:27:37,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:37,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:27:37,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-02 14:27:37,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:37,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-02 14:27:37,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:27:37,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:27:37,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:27:37,227 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-02 14:27:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:37,345 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-02 14:27:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:27:37,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-02 14:27:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:37,349 INFO L225 Difference]: With dead ends: 125 [2019-10-02 14:27:37,349 INFO L226 Difference]: Without dead ends: 87 [2019-10-02 14:27:37,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:27:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-02 14:27:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-02 14:27:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 14:27:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-02 14:27:37,358 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-02 14:27:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:37,358 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-02 14:27:37,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:27:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-02 14:27:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 14:27:37,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:37,359 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:37,360 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:37,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2019-10-02 14:27:37,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:37,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:37,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-02 14:27:37,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:37,643 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:37,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:37,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:27:37,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:37,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:37,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 14:27:37,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:27:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:27:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:27:37,791 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-02 14:27:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:37,863 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-02 14:27:37,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:27:37,864 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-02 14:27:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:37,864 INFO L225 Difference]: With dead ends: 128 [2019-10-02 14:27:37,864 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 14:27:37,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:27:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 14:27:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-02 14:27:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 14:27:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-02 14:27:37,868 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-02 14:27:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:37,869 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-02 14:27:37,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:27:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-02 14:27:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 14:27:37,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:37,870 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:37,870 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:37,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2019-10-02 14:27:37,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:37,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:37,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:37,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-02 14:27:38,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:38,161 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:38,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:38,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:38,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:38,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:27:38,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-02 14:27:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:38,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 14:27:38,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:27:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:27:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:27:38,300 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-02 14:27:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:38,400 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-02 14:27:38,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:27:38,400 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-02 14:27:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:38,401 INFO L225 Difference]: With dead ends: 130 [2019-10-02 14:27:38,401 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 14:27:38,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:27:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 14:27:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-02 14:27:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 14:27:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-02 14:27:38,406 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-02 14:27:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:38,407 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-02 14:27:38,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:27:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-02 14:27:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 14:27:38,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:38,408 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:38,409 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:38,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2019-10-02 14:27:38,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:38,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:38,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:38,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:38,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-02 14:27:38,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:38,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:38,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:38,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 14:27:38,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:38,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:27:38,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-02 14:27:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:38,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-02 14:27:38,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:27:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:27:38,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:27:38,941 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-02 14:27:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:39,077 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-02 14:27:39,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:27:39,077 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-02 14:27:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:39,078 INFO L225 Difference]: With dead ends: 135 [2019-10-02 14:27:39,078 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 14:27:39,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:27:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 14:27:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-02 14:27:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-02 14:27:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-02 14:27:39,085 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-02 14:27:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:39,085 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-02 14:27:39,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:27:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-02 14:27:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 14:27:39,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:39,091 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:39,091 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2019-10-02 14:27:39,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:39,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-02 14:27:39,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:39,438 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:39,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:39,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:39,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:39,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:27:39,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:39,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:39,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 14:27:39,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:27:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:27:39,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:27:39,607 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-02 14:27:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:39,696 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-02 14:27:39,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:27:39,698 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-02 14:27:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:39,699 INFO L225 Difference]: With dead ends: 138 [2019-10-02 14:27:39,699 INFO L226 Difference]: Without dead ends: 96 [2019-10-02 14:27:39,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:27:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-02 14:27:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-02 14:27:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 14:27:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-02 14:27:39,704 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-02 14:27:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:39,704 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-02 14:27:39,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:27:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-02 14:27:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 14:27:39,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:39,706 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:39,706 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:39,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2019-10-02 14:27:39,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:39,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:39,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-02 14:27:40,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:40,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:40,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:27:44,956 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-02 14:27:44,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:44,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:27:44,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-02 14:27:45,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:45,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-02 14:27:45,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:27:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:27:45,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:27:45,102 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-02 14:27:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:45,261 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-02 14:27:45,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:27:45,262 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-02 14:27:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:45,263 INFO L225 Difference]: With dead ends: 143 [2019-10-02 14:27:45,263 INFO L226 Difference]: Without dead ends: 101 [2019-10-02 14:27:45,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:27:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-02 14:27:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-02 14:27:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 14:27:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-02 14:27:45,268 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-02 14:27:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:45,269 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-02 14:27:45,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:27:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-02 14:27:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 14:27:45,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:45,270 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:45,271 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2019-10-02 14:27:45,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:45,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:45,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:45,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:45,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-02 14:27:45,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:45,664 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:45,698 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:27:46,629 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-02 14:27:46,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:46,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:27:46,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-10-02 14:27:46,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:46,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-02 14:27:46,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:27:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:27:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:27:46,772 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-02 14:27:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:46,908 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-02 14:27:46,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:27:46,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-02 14:27:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:46,913 INFO L225 Difference]: With dead ends: 149 [2019-10-02 14:27:46,914 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 14:27:46,914 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:27:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 14:27:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-02 14:27:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 14:27:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-02 14:27:46,920 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-02 14:27:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:46,920 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-02 14:27:46,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:27:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-02 14:27:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 14:27:46,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:46,921 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:46,922 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2019-10-02 14:27:46,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:46,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-02 14:27:47,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:47,281 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:47,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:47,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:27:47,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-02 14:27:47,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:47,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 14:27:47,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:27:47,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:27:47,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:27:47,415 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-02 14:27:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:47,533 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-02 14:27:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:27:47,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-02 14:27:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:47,535 INFO L225 Difference]: With dead ends: 152 [2019-10-02 14:27:47,535 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 14:27:47,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:27:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 14:27:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-02 14:27:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-02 14:27:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-02 14:27:47,540 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-02 14:27:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:47,541 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-02 14:27:47,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:27:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-02 14:27:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 14:27:47,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:47,542 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:47,542 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:47,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2019-10-02 14:27:47,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:47,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:47,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:47,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-02 14:27:48,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:48,115 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:48,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:48,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:48,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:48,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:27:48,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-02 14:27:48,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:48,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 14:27:48,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:27:48,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:27:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:27:48,285 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-02 14:27:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:48,371 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-02 14:27:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 14:27:48,372 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-02 14:27:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:48,373 INFO L225 Difference]: With dead ends: 154 [2019-10-02 14:27:48,373 INFO L226 Difference]: Without dead ends: 108 [2019-10-02 14:27:48,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:27:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-02 14:27:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-02 14:27:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-02 14:27:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-02 14:27:48,380 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-02 14:27:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:48,380 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-02 14:27:48,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:27:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-02 14:27:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:27:48,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:48,381 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:48,382 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2019-10-02 14:27:48,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:48,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-02 14:27:48,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:48,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:49,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:49,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-02 14:27:49,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:49,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:27:49,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:49,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:49,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-02 14:27:49,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 14:27:49,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 14:27:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:27:49,451 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-02 14:27:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:49,639 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-02 14:27:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:27:49,640 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-02 14:27:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:49,641 INFO L225 Difference]: With dead ends: 159 [2019-10-02 14:27:49,641 INFO L226 Difference]: Without dead ends: 113 [2019-10-02 14:27:49,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:27:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-02 14:27:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-02 14:27:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-02 14:27:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-02 14:27:49,646 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-02 14:27:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:49,647 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-02 14:27:49,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 14:27:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-02 14:27:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 14:27:49,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:49,648 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:49,648 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:49,649 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2019-10-02 14:27:49,649 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:49,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-02 14:27:50,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:50,235 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:50,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:50,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:50,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:50,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:27:50,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-02 14:27:50,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:50,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-02 14:27:50,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 14:27:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 14:27:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:27:50,615 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-02 14:27:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:50,776 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-02 14:27:50,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:27:50,778 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-02 14:27:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:50,779 INFO L225 Difference]: With dead ends: 165 [2019-10-02 14:27:50,779 INFO L226 Difference]: Without dead ends: 117 [2019-10-02 14:27:50,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:27:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-02 14:27:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-02 14:27:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-02 14:27:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-02 14:27:50,785 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-02 14:27:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:50,785 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-02 14:27:50,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 14:27:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-02 14:27:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:27:50,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:50,787 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:50,787 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:50,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2019-10-02 14:27:50,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:50,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-02 14:27:51,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:51,450 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:27:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:28:09,513 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-02 14:28:09,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:09,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:28:09,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-02 14:28:09,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:09,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-02 14:28:09,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:28:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:28:09,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:28:09,800 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-02 14:28:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:10,034 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-02 14:28:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 14:28:10,035 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-02 14:28:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:10,036 INFO L225 Difference]: With dead ends: 171 [2019-10-02 14:28:10,036 INFO L226 Difference]: Without dead ends: 121 [2019-10-02 14:28:10,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:28:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-02 14:28:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-02 14:28:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-02 14:28:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-02 14:28:10,045 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-02 14:28:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:10,046 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-02 14:28:10,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:28:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-02 14:28:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:28:10,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:10,047 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:10,048 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2019-10-02 14:28:10,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:10,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:10,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-02 14:28:10,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:10,733 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:28:10,796 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:28:12,466 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-02 14:28:12,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:12,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:28:12,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-02 14:28:12,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:12,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-02 14:28:12,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:28:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:28:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:28:12,663 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-02 14:28:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:12,897 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-02 14:28:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 14:28:12,898 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-02 14:28:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:12,899 INFO L225 Difference]: With dead ends: 177 [2019-10-02 14:28:12,899 INFO L226 Difference]: Without dead ends: 125 [2019-10-02 14:28:12,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:28:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-02 14:28:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-02 14:28:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-02 14:28:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-02 14:28:12,906 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-02 14:28:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:12,907 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-02 14:28:12,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:28:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-02 14:28:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:28:12,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:12,909 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:12,909 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2019-10-02 14:28:12,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:12,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:12,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:12,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-02 14:28:13,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:13,432 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:28:13,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:13,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:28:13,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-02 14:28:13,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:13,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-02 14:28:13,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 14:28:13,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 14:28:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:28:13,629 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-02 14:28:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:13,742 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-02 14:28:13,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:28:13,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-02 14:28:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:13,744 INFO L225 Difference]: With dead ends: 180 [2019-10-02 14:28:13,744 INFO L226 Difference]: Without dead ends: 126 [2019-10-02 14:28:13,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:28:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-02 14:28:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-02 14:28:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-02 14:28:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-02 14:28:13,750 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-02 14:28:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:13,750 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-02 14:28:13,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 14:28:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-02 14:28:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:28:13,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:13,751 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:13,752 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2019-10-02 14:28:13,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:13,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:13,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-02 14:28:14,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:14,260 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:28:14,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:28:14,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:28:14,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:14,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:28:14,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-02 14:28:14,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:14,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:28:14,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:28:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:28:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:28:14,436 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-02 14:28:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:14,575 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-02 14:28:14,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:28:14,575 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-02 14:28:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:14,576 INFO L225 Difference]: With dead ends: 182 [2019-10-02 14:28:14,577 INFO L226 Difference]: Without dead ends: 128 [2019-10-02 14:28:14,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:28:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-02 14:28:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-02 14:28:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-02 14:28:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-02 14:28:14,583 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-02 14:28:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:14,583 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-02 14:28:14,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:28:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-02 14:28:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 14:28:14,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:14,585 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:14,585 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2019-10-02 14:28:14,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:14,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-02 14:28:15,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:15,138 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:28:15,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:28:15,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-02 14:28:15,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:15,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:28:15,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2019-10-02 14:28:15,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:15,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-02 14:28:15,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 14:28:15,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 14:28:15,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:28:15,682 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-02 14:28:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:15,870 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-02 14:28:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 14:28:15,870 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-02 14:28:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:15,872 INFO L225 Difference]: With dead ends: 187 [2019-10-02 14:28:15,872 INFO L226 Difference]: Without dead ends: 133 [2019-10-02 14:28:15,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:28:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-02 14:28:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-02 14:28:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-02 14:28:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-02 14:28:15,882 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-02 14:28:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:15,884 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-02 14:28:15,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 14:28:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-02 14:28:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 14:28:15,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:15,885 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:15,886 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2019-10-02 14:28:15,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:15,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:15,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-10-02 14:28:16,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:16,626 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:28:16,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:28:16,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:28:16,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:16,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:28:16,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-02 14:28:17,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:17,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-02 14:28:17,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 14:28:17,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 14:28:17,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:28:17,088 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-02 14:28:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:17,484 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-02 14:28:17,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 14:28:17,485 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-02 14:28:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:17,487 INFO L225 Difference]: With dead ends: 193 [2019-10-02 14:28:17,487 INFO L226 Difference]: Without dead ends: 137 [2019-10-02 14:28:17,489 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:28:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-02 14:28:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-02 14:28:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-02 14:28:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-02 14:28:17,495 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-02 14:28:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:17,496 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-02 14:28:17,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 14:28:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-02 14:28:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 14:28:17,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:17,498 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:17,498 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2019-10-02 14:28:17,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:17,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-10-02 14:28:18,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:18,202 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:28:18,258 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:29:29,748 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-02 14:29:29,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:29,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:29:29,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-10-02 14:29:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-02 14:29:30,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 14:29:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 14:29:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:29:30,032 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-02 14:29:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:30,226 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-02 14:29:30,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 14:29:30,226 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-02 14:29:30,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:30,227 INFO L225 Difference]: With dead ends: 199 [2019-10-02 14:29:30,227 INFO L226 Difference]: Without dead ends: 141 [2019-10-02 14:29:30,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:29:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-02 14:29:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-02 14:29:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-02 14:29:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-02 14:29:30,233 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-02 14:29:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:30,234 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-02 14:29:30,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 14:29:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-02 14:29:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 14:29:30,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:30,235 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:30,236 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2019-10-02 14:29:30,236 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:30,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:30,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-10-02 14:29:30,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:30,839 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:29:30,890 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:29:42,862 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-02 14:29:42,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:42,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 14:29:42,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-10-02 14:29:43,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:43,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-02 14:29:43,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:29:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:29:43,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:29:43,134 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-02 14:29:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:43,393 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-02 14:29:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 14:29:43,393 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-02 14:29:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:43,394 INFO L225 Difference]: With dead ends: 205 [2019-10-02 14:29:43,395 INFO L226 Difference]: Without dead ends: 145 [2019-10-02 14:29:43,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:29:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-02 14:29:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-02 14:29:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-02 14:29:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-02 14:29:43,403 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-02 14:29:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:43,403 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-02 14:29:43,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:29:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-02 14:29:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 14:29:43,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:43,406 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:43,407 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2019-10-02 14:29:43,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:43,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:43,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-02 14:29:44,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:44,385 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:29:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:44,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 14:29:44,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-02 14:29:44,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:44,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-02 14:29:44,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:29:44,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:29:44,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:29:44,613 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-02 14:29:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:44,761 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-02 14:29:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:29:44,762 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-02 14:29:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:44,763 INFO L225 Difference]: With dead ends: 208 [2019-10-02 14:29:44,763 INFO L226 Difference]: Without dead ends: 146 [2019-10-02 14:29:44,764 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:29:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-02 14:29:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-02 14:29:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-02 14:29:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-02 14:29:44,769 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-02 14:29:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:44,770 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-02 14:29:44,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:29:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-02 14:29:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 14:29:44,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:44,771 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:44,771 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2019-10-02 14:29:44,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:44,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:44,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:44,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:44,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-02 14:29:45,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:45,771 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:29:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:29:45,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:29:45,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:45,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 14:29:45,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:29:45,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:45,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-02 14:29:45,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:29:45,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:29:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:29:45,971 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-02 14:29:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:46,093 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-02 14:29:46,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:29:46,093 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-02 14:29:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:46,094 INFO L225 Difference]: With dead ends: 210 [2019-10-02 14:29:46,094 INFO L226 Difference]: Without dead ends: 148 [2019-10-02 14:29:46,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:29:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-02 14:29:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-02 14:29:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-02 14:29:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-02 14:29:46,103 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-02 14:29:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:46,103 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-02 14:29:46,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:29:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-02 14:29:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 14:29:46,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:46,105 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:46,105 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:46,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2019-10-02 14:29:46,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:46,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:46,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:46,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:46,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-02 14:29:46,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:46,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:29:46,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:29:47,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-02 14:29:47,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:47,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 14:29:47,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2019-10-02 14:29:48,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:48,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-02 14:29:48,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 14:29:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 14:29:48,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 14:29:48,006 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-02 14:29:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:48,215 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2019-10-02 14:29:48,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 14:29:48,221 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-02 14:29:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:48,222 INFO L225 Difference]: With dead ends: 214 [2019-10-02 14:29:48,222 INFO L226 Difference]: Without dead ends: 152 [2019-10-02 14:29:48,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 14:29:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-02 14:29:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-10-02 14:29:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 14:29:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-02 14:29:48,231 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-02 14:29:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:48,232 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-02 14:29:48,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 14:29:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-02 14:29:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 14:29:48,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:48,234 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:48,234 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:48,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2019-10-02 14:29:48,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:48,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:48,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:48,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 368 proven. 537 refuted. 0 times theorem prover too weak. 2430 trivial. 0 not checked. [2019-10-02 14:29:48,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:48,497 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:29:48,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:29:48,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:29:48,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:48,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:29:48,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2434 trivial. 0 not checked. [2019-10-02 14:29:48,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:48,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 14:29:48,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:29:48,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:29:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:29:48,711 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 17 states. [2019-10-02 14:29:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:48,749 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2019-10-02 14:29:48,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:29:48,750 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 212 [2019-10-02 14:29:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:48,751 INFO L225 Difference]: With dead ends: 217 [2019-10-02 14:29:48,751 INFO L226 Difference]: Without dead ends: 154 [2019-10-02 14:29:48,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:29:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-02 14:29:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-02 14:29:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-02 14:29:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-02 14:29:48,757 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-02 14:29:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:48,757 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-02 14:29:48,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:29:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-02 14:29:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 14:29:48,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:48,759 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 40, 40, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:48,759 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash 823572649, now seen corresponding path program 41 times [2019-10-02 14:29:48,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:48,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:48,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3584 backedges. 848 proven. 196 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2019-10-02 14:29:49,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:49,022 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:29:49,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:31:16,562 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-10-02 14:31:16,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:31:16,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:31:16,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:31:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3584 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-10-02 14:31:16,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:31:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 14:31:16,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:31:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:31:16,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:31:16,657 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 18 states. [2019-10-02 14:31:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:31:16,712 INFO L93 Difference]: Finished difference Result 221 states and 231 transitions. [2019-10-02 14:31:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:31:16,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 218 [2019-10-02 14:31:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:31:16,714 INFO L225 Difference]: With dead ends: 221 [2019-10-02 14:31:16,714 INFO L226 Difference]: Without dead ends: 156 [2019-10-02 14:31:16,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:31:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-02 14:31:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-10-02 14:31:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-02 14:31:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-10-02 14:31:16,720 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 218 [2019-10-02 14:31:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:31:16,720 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-10-02 14:31:16,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:31:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-10-02 14:31:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 14:31:16,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:31:16,723 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 40, 40, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:31:16,723 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:31:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:31:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash -586116441, now seen corresponding path program 42 times [2019-10-02 14:31:16,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:31:16,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:31:16,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:16,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:31:16,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:31:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 968 proven. 225 refuted. 0 times theorem prover too weak. 2658 trivial. 0 not checked. [2019-10-02 14:31:17,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:31:17,002 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:31:17,070 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:31:26,277 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-02 14:31:26,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:31:26,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 14:31:26,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:31:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 970 proven. 121 refuted. 0 times theorem prover too weak. 2760 trivial. 0 not checked. [2019-10-02 14:31:26,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:31:26,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2019-10-02 14:31:26,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:31:26,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:31:26,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:31:26,501 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 30 states. [2019-10-02 14:31:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:31:26,616 INFO L93 Difference]: Finished difference Result 228 states and 239 transitions. [2019-10-02 14:31:26,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:31:26,617 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 224 [2019-10-02 14:31:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:31:26,619 INFO L225 Difference]: With dead ends: 228 [2019-10-02 14:31:26,619 INFO L226 Difference]: Without dead ends: 161 [2019-10-02 14:31:26,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:31:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-02 14:31:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-10-02 14:31:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-02 14:31:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-10-02 14:31:26,625 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 224 [2019-10-02 14:31:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:31:26,625 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-10-02 14:31:26,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:31:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-10-02 14:31:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 14:31:26,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:31:26,627 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 40, 40, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:31:26,628 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:31:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:31:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -516427997, now seen corresponding path program 43 times [2019-10-02 14:31:26,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:31:26,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:31:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:26,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:31:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:31:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4159 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 2807 trivial. 0 not checked. [2019-10-02 14:31:26,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:31:26,972 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:31:27,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:31:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:31:27,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:31:27,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:31:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4159 backedges. 1092 proven. 256 refuted. 0 times theorem prover too weak. 2811 trivial. 0 not checked. [2019-10-02 14:31:27,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:31:27,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 14:31:27,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:31:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:31:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:31:27,189 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 20 states. [2019-10-02 14:31:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:31:27,228 INFO L93 Difference]: Finished difference Result 233 states and 243 transitions. [2019-10-02 14:31:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:31:27,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 232 [2019-10-02 14:31:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:31:27,229 INFO L225 Difference]: With dead ends: 233 [2019-10-02 14:31:27,229 INFO L226 Difference]: Without dead ends: 162 [2019-10-02 14:31:27,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:31:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-02 14:31:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-10-02 14:31:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-02 14:31:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-02 14:31:27,236 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 232 [2019-10-02 14:31:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:31:27,237 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-02 14:31:27,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:31:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-02 14:31:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 14:31:27,238 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:31:27,239 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 40, 40, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:31:27,239 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:31:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:31:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash -137075551, now seen corresponding path program 44 times [2019-10-02 14:31:27,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:31:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:31:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:27,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:31:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:31:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4462 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2941 trivial. 0 not checked. [2019-10-02 14:31:27,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:31:27,536 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 14:31:27,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:31:27,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:31:27,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:31:27,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:31:27,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:31:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4462 backedges. 1228 proven. 289 refuted. 0 times theorem prover too weak. 2945 trivial. 0 not checked. [2019-10-02 14:31:27,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:31:27,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-02 14:31:27,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:31:27,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:31:27,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:31:27,766 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 21 states. [2019-10-02 14:31:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:31:27,828 INFO L93 Difference]: Finished difference Result 237 states and 247 transitions. [2019-10-02 14:31:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:31:27,829 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 238 [2019-10-02 14:31:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:31:27,830 INFO L225 Difference]: With dead ends: 237 [2019-10-02 14:31:27,830 INFO L226 Difference]: Without dead ends: 164 [2019-10-02 14:31:27,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:31:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-02 14:31:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-02 14:31:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-02 14:31:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-02 14:31:27,840 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 238 [2019-10-02 14:31:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:31:27,840 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-02 14:31:27,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:31:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-02 14:31:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 14:31:27,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:31:27,842 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 40, 40, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:31:27,842 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:31:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:31:27,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1483506591, now seen corresponding path program 45 times [2019-10-02 14:31:27,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:31:27,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:31:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:27,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:31:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:31:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4783 backedges. 0 proven. 1700 refuted. 0 times theorem prover too weak. 3083 trivial. 0 not checked. [2019-10-02 14:31:28,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:31:28,181 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:31:28,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:31:29,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-02 14:31:29,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:31:29,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 14:31:29,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:31:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4783 backedges. 1378 proven. 144 refuted. 0 times theorem prover too weak. 3261 trivial. 0 not checked. [2019-10-02 14:31:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:31:29,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 34 [2019-10-02 14:31:29,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:31:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:31:29,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:31:29,519 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 34 states. [2019-10-02 14:31:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:31:29,649 INFO L93 Difference]: Finished difference Result 244 states and 255 transitions. [2019-10-02 14:31:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:31:29,650 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 244 [2019-10-02 14:31:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:31:29,651 INFO L225 Difference]: With dead ends: 244 [2019-10-02 14:31:29,652 INFO L226 Difference]: Without dead ends: 169 [2019-10-02 14:31:29,653 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:31:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-02 14:31:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-10-02 14:31:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-02 14:31:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-02 14:31:29,658 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 244 [2019-10-02 14:31:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:31:29,659 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-02 14:31:29,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:31:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-02 14:31:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 14:31:29,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:31:29,661 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 40, 40, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:31:29,661 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:31:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:31:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash -827713765, now seen corresponding path program 46 times [2019-10-02 14:31:29,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:31:29,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:31:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:29,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:31:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:31:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5147 backedges. 0 proven. 1889 refuted. 0 times theorem prover too weak. 3258 trivial. 0 not checked. [2019-10-02 14:31:30,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:31:30,005 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:31:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:31:30,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:31:30,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:31:30,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:31:30,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:31:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5147 backedges. 1524 proven. 361 refuted. 0 times theorem prover too weak. 3262 trivial. 0 not checked. [2019-10-02 14:31:30,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:31:30,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 14:31:30,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:31:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:31:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:31:30,259 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 23 states. [2019-10-02 14:31:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:31:30,325 INFO L93 Difference]: Finished difference Result 249 states and 259 transitions. [2019-10-02 14:31:30,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:31:30,326 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 252 [2019-10-02 14:31:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:31:30,327 INFO L225 Difference]: With dead ends: 249 [2019-10-02 14:31:30,327 INFO L226 Difference]: Without dead ends: 170 [2019-10-02 14:31:30,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:31:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-02 14:31:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-10-02 14:31:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-02 14:31:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-10-02 14:31:30,333 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 252 [2019-10-02 14:31:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:31:30,333 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-10-02 14:31:30,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:31:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-10-02 14:31:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 14:31:30,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:31:30,335 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 40, 40, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:31:30,336 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:31:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:31:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1227952537, now seen corresponding path program 47 times [2019-10-02 14:31:30,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:31:30,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:31:30,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:30,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:31:30,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:31:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:31:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2019-10-02 14:31:30,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:31:30,677 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:31:30,739 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:32:11,746 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-02 14:32:11,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:11,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:32:11,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 1684 proven. 400 refuted. 0 times theorem prover too weak. 3420 trivial. 0 not checked. [2019-10-02 14:32:11,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:11,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 14:32:11,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:32:11,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:32:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:32:11,885 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 24 states. [2019-10-02 14:32:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:11,944 INFO L93 Difference]: Finished difference Result 253 states and 263 transitions. [2019-10-02 14:32:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:32:11,944 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 258 [2019-10-02 14:32:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:11,946 INFO L225 Difference]: With dead ends: 253 [2019-10-02 14:32:11,946 INFO L226 Difference]: Without dead ends: 172 [2019-10-02 14:32:11,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:32:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-02 14:32:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-02 14:32:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-02 14:32:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-02 14:32:11,956 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 258 [2019-10-02 14:32:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:11,957 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-02 14:32:11,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:32:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-02 14:32:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 14:32:11,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:11,960 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 40, 40, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:32:11,960 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1785039465, now seen corresponding path program 48 times [2019-10-02 14:32:11,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:11,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:11,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5879 backedges. 0 proven. 2297 refuted. 0 times theorem prover too weak. 3582 trivial. 0 not checked. [2019-10-02 14:32:12,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:12,336 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:32:12,405 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:32:14,671 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-02 14:32:14,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:14,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:32:14,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5879 backedges. 1858 proven. 169 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2019-10-02 14:32:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:14,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2019-10-02 14:32:14,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 14:32:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 14:32:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:32:14,980 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 38 states. [2019-10-02 14:32:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:15,132 INFO L93 Difference]: Finished difference Result 260 states and 271 transitions. [2019-10-02 14:32:15,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:32:15,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 264 [2019-10-02 14:32:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:15,134 INFO L225 Difference]: With dead ends: 260 [2019-10-02 14:32:15,134 INFO L226 Difference]: Without dead ends: 177 [2019-10-02 14:32:15,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:32:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-02 14:32:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-10-02 14:32:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-02 14:32:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2019-10-02 14:32:15,140 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 264 [2019-10-02 14:32:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:15,141 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2019-10-02 14:32:15,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 14:32:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2019-10-02 14:32:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 14:32:15,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:15,143 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 40, 40, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:32:15,143 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:15,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1265172499, now seen corresponding path program 49 times [2019-10-02 14:32:15,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:15,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:15,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:15,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6299 backedges. 0 proven. 2516 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2019-10-02 14:32:15,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:15,539 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:32:15,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:32:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:15,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:32:15,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6299 backedges. 2028 proven. 484 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:32:15,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:15,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 14:32:15,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:32:15,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:32:15,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:32:15,813 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 26 states. [2019-10-02 14:32:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:15,913 INFO L93 Difference]: Finished difference Result 265 states and 275 transitions. [2019-10-02 14:32:15,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:32:15,914 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 272 [2019-10-02 14:32:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:15,915 INFO L225 Difference]: With dead ends: 265 [2019-10-02 14:32:15,915 INFO L226 Difference]: Without dead ends: 178 [2019-10-02 14:32:15,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:32:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-02 14:32:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-10-02 14:32:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-02 14:32:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-02 14:32:15,922 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 272 [2019-10-02 14:32:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:15,924 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-02 14:32:15,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:32:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-02 14:32:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 14:32:15,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:15,926 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 40, 40, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:32:15,926 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash 520978321, now seen corresponding path program 50 times [2019-10-02 14:32:15,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:15,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:15,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:32:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6710 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 3965 trivial. 0 not checked. [2019-10-02 14:32:16,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:16,292 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:32:16,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:32:16,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:32:16,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:16,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:32:16,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6710 backedges. 2212 proven. 529 refuted. 0 times theorem prover too weak. 3969 trivial. 0 not checked. [2019-10-02 14:32:16,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-02 14:32:16,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:32:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:32:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:32:16,581 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 27 states. [2019-10-02 14:32:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:16,684 INFO L93 Difference]: Finished difference Result 269 states and 279 transitions. [2019-10-02 14:32:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:32:16,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 278 [2019-10-02 14:32:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:16,686 INFO L225 Difference]: With dead ends: 269 [2019-10-02 14:32:16,686 INFO L226 Difference]: Without dead ends: 180 [2019-10-02 14:32:16,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:32:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-02 14:32:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-10-02 14:32:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-02 14:32:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-10-02 14:32:16,695 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 278 [2019-10-02 14:32:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:16,695 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-10-02 14:32:16,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:32:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-10-02 14:32:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 14:32:16,698 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:16,698 INFO L411 BasicCegarLoop]: trace histogram [72, 72, 40, 40, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:32:16,699 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1683695759, now seen corresponding path program 51 times [2019-10-02 14:32:16,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:16,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:16,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 0 proven. 2984 refuted. 0 times theorem prover too weak. 4155 trivial. 0 not checked. [2019-10-02 14:32:17,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:17,208 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:32:17,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:32:18,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-02 14:32:18,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:18,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:32:18,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 2410 proven. 196 refuted. 0 times theorem prover too weak. 4533 trivial. 0 not checked. [2019-10-02 14:32:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17] total 42 [2019-10-02 14:32:19,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:32:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:32:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=1236, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:32:19,211 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 42 states. [2019-10-02 14:32:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:19,360 INFO L93 Difference]: Finished difference Result 276 states and 287 transitions. [2019-10-02 14:32:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 14:32:19,361 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 284 [2019-10-02 14:32:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:19,362 INFO L225 Difference]: With dead ends: 276 [2019-10-02 14:32:19,362 INFO L226 Difference]: Without dead ends: 185 [2019-10-02 14:32:19,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=486, Invalid=1236, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:32:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-02 14:32:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2019-10-02 14:32:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-02 14:32:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-02 14:32:19,368 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 284 [2019-10-02 14:32:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:19,368 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-02 14:32:19,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:32:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-02 14:32:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 14:32:19,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:19,371 INFO L411 BasicCegarLoop]: trace histogram [75, 75, 40, 40, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:32:19,371 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 753232395, now seen corresponding path program 52 times [2019-10-02 14:32:19,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:19,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:19,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7615 backedges. 0 proven. 3233 refuted. 0 times theorem prover too weak. 4382 trivial. 0 not checked. [2019-10-02 14:32:19,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:19,936 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:32:20,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:32:20,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:32:20,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:20,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:32:20,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7615 backedges. 2608 proven. 625 refuted. 0 times theorem prover too weak. 4382 trivial. 0 not checked. [2019-10-02 14:32:20,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:20,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 14:32:20,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:32:20,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:32:20,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:32:20,263 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 29 states. [2019-10-02 14:32:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:20,343 INFO L93 Difference]: Finished difference Result 281 states and 291 transitions. [2019-10-02 14:32:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:32:20,344 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 292 [2019-10-02 14:32:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:20,345 INFO L225 Difference]: With dead ends: 281 [2019-10-02 14:32:20,346 INFO L226 Difference]: Without dead ends: 186 [2019-10-02 14:32:20,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:32:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-02 14:32:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-10-02 14:32:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-02 14:32:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-02 14:32:20,352 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 292 [2019-10-02 14:32:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:20,352 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-02 14:32:20,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:32:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-02 14:32:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 14:32:20,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:20,355 INFO L411 BasicCegarLoop]: trace histogram [78, 78, 40, 40, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:32:20,355 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:20,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:20,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1397068151, now seen corresponding path program 53 times [2019-10-02 14:32:20,355 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:20,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8080 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 4588 trivial. 0 not checked. [2019-10-02 14:32:20,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:20,962 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:32:21,034 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:33:59,409 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-02 14:33:59,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:33:59,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:33:59,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:33:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8080 backedges. 2812 proven. 676 refuted. 0 times theorem prover too weak. 4592 trivial. 0 not checked. [2019-10-02 14:33:59,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:33:59,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 14:33:59,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:33:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:33:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:33:59,530 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 30 states. [2019-10-02 14:33:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:33:59,619 INFO L93 Difference]: Finished difference Result 285 states and 295 transitions. [2019-10-02 14:33:59,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 14:33:59,619 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 298 [2019-10-02 14:33:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:33:59,621 INFO L225 Difference]: With dead ends: 285 [2019-10-02 14:33:59,621 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 14:33:59,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:33:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 14:33:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-10-02 14:33:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-02 14:33:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-10-02 14:33:59,627 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 298 [2019-10-02 14:33:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:33:59,627 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-10-02 14:33:59,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:33:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-10-02 14:33:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 14:33:59,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:33:59,629 INFO L411 BasicCegarLoop]: trace histogram [81, 81, 40, 40, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:33:59,630 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:33:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:33:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1243652985, now seen corresponding path program 54 times [2019-10-02 14:33:59,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:33:59,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:33:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:33:59,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:33:59,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:33:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8563 backedges. 0 proven. 3761 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2019-10-02 14:34:00,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:34:00,097 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:34:00,167 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:34:01,467 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-02 14:34:01,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:34:01,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:34:01,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:34:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8563 backedges. 3034 proven. 225 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-10-02 14:34:01,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:34:01,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 46 [2019-10-02 14:34:01,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 14:34:01,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 14:34:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=1483, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:34:01,814 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 46 states. [2019-10-02 14:34:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:34:02,002 INFO L93 Difference]: Finished difference Result 292 states and 303 transitions. [2019-10-02 14:34:02,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 14:34:02,002 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 304 [2019-10-02 14:34:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:34:02,004 INFO L225 Difference]: With dead ends: 292 [2019-10-02 14:34:02,004 INFO L226 Difference]: Without dead ends: 193 [2019-10-02 14:34:02,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=587, Invalid=1483, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:34:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-02 14:34:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-10-02 14:34:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-02 14:34:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-02 14:34:02,011 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 304 [2019-10-02 14:34:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:34:02,012 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-02 14:34:02,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 14:34:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-02 14:34:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 14:34:02,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:34:02,014 INFO L411 BasicCegarLoop]: trace histogram [84, 84, 40, 40, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:34:02,014 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:34:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:34:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash -167766781, now seen corresponding path program 55 times [2019-10-02 14:34:02,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:34:02,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:34:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:02,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:34:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9095 backedges. 0 proven. 4040 refuted. 0 times theorem prover too weak. 5055 trivial. 0 not checked. [2019-10-02 14:34:02,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:34:02,567 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:34:02,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:34:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:02,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 14:34:02,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:34:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9095 backedges. 3252 proven. 784 refuted. 0 times theorem prover too weak. 5059 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (57)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:34:02,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:34:02,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-02 14:34:02,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:34:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:34:02,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:34:02,878 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 32 states. [2019-10-02 14:34:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:34:02,989 INFO L93 Difference]: Finished difference Result 297 states and 307 transitions. [2019-10-02 14:34:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:34:02,989 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 312 [2019-10-02 14:34:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:34:02,991 INFO L225 Difference]: With dead ends: 297 [2019-10-02 14:34:02,991 INFO L226 Difference]: Without dead ends: 194 [2019-10-02 14:34:02,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:34:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-02 14:34:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-10-02 14:34:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-02 14:34:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 197 transitions. [2019-10-02 14:34:02,998 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 197 transitions. Word has length 312 [2019-10-02 14:34:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:34:02,999 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 197 transitions. [2019-10-02 14:34:02,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:34:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2019-10-02 14:34:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-02 14:34:03,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:34:03,003 INFO L411 BasicCegarLoop]: trace histogram [87, 87, 40, 40, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:34:03,003 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:34:03,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:34:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1158111615, now seen corresponding path program 56 times [2019-10-02 14:34:03,004 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:34:03,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:34:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:34:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9614 backedges. 0 proven. 4329 refuted. 0 times theorem prover too weak. 5285 trivial. 0 not checked. [2019-10-02 14:34:03,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:34:03,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:34:03,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:34:03,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:34:03,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:34:03,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 14:34:03,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:34:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9614 backedges. 3484 proven. 841 refuted. 0 times theorem prover too weak. 5289 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:34:03,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:34:03,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-02 14:34:03,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:34:03,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:34:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:34:03,949 INFO L87 Difference]: Start difference. First operand 193 states and 197 transitions. Second operand 33 states. [2019-10-02 14:34:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:34:04,036 INFO L93 Difference]: Finished difference Result 301 states and 311 transitions. [2019-10-02 14:34:04,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:34:04,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 318 [2019-10-02 14:34:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:34:04,038 INFO L225 Difference]: With dead ends: 301 [2019-10-02 14:34:04,038 INFO L226 Difference]: Without dead ends: 196 [2019-10-02 14:34:04,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:34:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-02 14:34:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-10-02 14:34:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 14:34:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-02 14:34:04,042 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 318 [2019-10-02 14:34:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:34:04,043 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-02 14:34:04,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:34:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-02 14:34:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 14:34:04,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:34:04,045 INFO L411 BasicCegarLoop]: trace histogram [90, 90, 40, 40, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:34:04,045 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:34:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:34:04,046 INFO L82 PathProgramCache]: Analyzing trace with hash -121122433, now seen corresponding path program 57 times [2019-10-02 14:34:04,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:34:04,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:34:04,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:04,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:34:04,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10151 backedges. 0 proven. 4628 refuted. 0 times theorem prover too weak. 5523 trivial. 0 not checked. [2019-10-02 14:34:04,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:34:04,688 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:34:04,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:34:07,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-02 14:34:07,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:34:07,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:34:07,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:34:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10151 backedges. 3730 proven. 256 refuted. 0 times theorem prover too weak. 6165 trivial. 0 not checked. [2019-10-02 14:34:08,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:34:08,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2019-10-02 14:34:08,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 14:34:08,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 14:34:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=1752, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:34:08,340 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 50 states. [2019-10-02 14:34:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:34:08,517 INFO L93 Difference]: Finished difference Result 308 states and 319 transitions. [2019-10-02 14:34:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 14:34:08,517 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 324 [2019-10-02 14:34:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:34:08,519 INFO L225 Difference]: With dead ends: 308 [2019-10-02 14:34:08,519 INFO L226 Difference]: Without dead ends: 201 [2019-10-02 14:34:08,520 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=698, Invalid=1752, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:34:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-02 14:34:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-10-02 14:34:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-02 14:34:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-02 14:34:08,526 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 324 [2019-10-02 14:34:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:34:08,526 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-02 14:34:08,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 14:34:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-02 14:34:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:34:08,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:34:08,529 INFO L411 BasicCegarLoop]: trace histogram [93, 93, 40, 40, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:34:08,530 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:34:08,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:34:08,530 INFO L82 PathProgramCache]: Analyzing trace with hash 856277243, now seen corresponding path program 58 times [2019-10-02 14:34:08,530 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:34:08,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:34:08,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:08,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:34:08,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10739 backedges. 0 proven. 4937 refuted. 0 times theorem prover too weak. 5802 trivial. 0 not checked. [2019-10-02 14:34:09,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:34:09,458 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:34:09,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:34:09,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:34:09,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:34:09,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:34:09,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:34:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10739 backedges. 3976 proven. 961 refuted. 0 times theorem prover too weak. 5802 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (60)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:34:09,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:34:09,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-02 14:34:09,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 14:34:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 14:34:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:34:09,948 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 35 states. [2019-10-02 14:34:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:34:10,077 INFO L93 Difference]: Finished difference Result 313 states and 323 transitions. [2019-10-02 14:34:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:34:10,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 332 [2019-10-02 14:34:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:34:10,080 INFO L225 Difference]: With dead ends: 313 [2019-10-02 14:34:10,080 INFO L226 Difference]: Without dead ends: 202 [2019-10-02 14:34:10,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:34:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-02 14:34:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-02 14:34:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-02 14:34:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-02 14:34:10,091 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 332 [2019-10-02 14:34:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:34:10,091 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-02 14:34:10,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 14:34:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-02 14:34:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-02 14:34:10,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:34:10,097 INFO L411 BasicCegarLoop]: trace histogram [96, 96, 40, 40, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:34:10,097 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:34:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:34:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash 66637689, now seen corresponding path program 59 times [2019-10-02 14:34:10,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:34:10,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:34:10,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:10,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:34:10,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11312 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 6056 trivial. 0 not checked. [2019-10-02 14:34:10,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:34:10,937 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:34:11,018 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:36:39,984 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-10-02 14:36:39,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:36:40,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:36:40,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:36:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11312 backedges. 4228 proven. 1024 refuted. 0 times theorem prover too weak. 6060 trivial. 0 not checked. [2019-10-02 14:36:40,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:36:40,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:36:40,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:36:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:36:40,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:36:40,118 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 36 states. [2019-10-02 14:36:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:36:40,214 INFO L93 Difference]: Finished difference Result 317 states and 327 transitions. [2019-10-02 14:36:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:36:40,214 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 338 [2019-10-02 14:36:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:36:40,216 INFO L225 Difference]: With dead ends: 317 [2019-10-02 14:36:40,216 INFO L226 Difference]: Without dead ends: 204 [2019-10-02 14:36:40,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:36:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-02 14:36:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-02 14:36:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-02 14:36:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-02 14:36:40,222 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 338 [2019-10-02 14:36:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:36:40,224 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-02 14:36:40,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:36:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-02 14:36:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-02 14:36:40,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:36:40,227 INFO L411 BasicCegarLoop]: trace histogram [99, 99, 40, 40, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:36:40,227 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:36:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:36:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1965377399, now seen corresponding path program 60 times [2019-10-02 14:36:40,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:36:40,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:36:40,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:40,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:36:40,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:36:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 11903 backedges. 0 proven. 5585 refuted. 0 times theorem prover too weak. 6318 trivial. 0 not checked. [2019-10-02 14:36:40,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:36:40,944 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:36:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:36:43,623 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-10-02 14:36:43,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:36:43,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:36:43,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:36:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11903 backedges. 4498 proven. 289 refuted. 0 times theorem prover too weak. 7116 trivial. 0 not checked. [2019-10-02 14:36:44,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:36:44,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 20] total 54 [2019-10-02 14:36:44,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 14:36:44,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 14:36:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=2043, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 14:36:44,057 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 54 states. [2019-10-02 14:36:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:36:44,309 INFO L93 Difference]: Finished difference Result 324 states and 335 transitions. [2019-10-02 14:36:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 14:36:44,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 344 [2019-10-02 14:36:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:36:44,312 INFO L225 Difference]: With dead ends: 324 [2019-10-02 14:36:44,312 INFO L226 Difference]: Without dead ends: 209 [2019-10-02 14:36:44,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=819, Invalid=2043, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 14:36:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-02 14:36:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-10-02 14:36:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-02 14:36:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2019-10-02 14:36:44,318 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 344 [2019-10-02 14:36:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:36:44,319 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2019-10-02 14:36:44,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 14:36:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2019-10-02 14:36:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 14:36:44,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:36:44,321 INFO L411 BasicCegarLoop]: trace histogram [102, 102, 40, 40, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:36:44,322 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:36:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:36:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash -708629005, now seen corresponding path program 61 times [2019-10-02 14:36:44,322 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:36:44,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:36:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:44,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:36:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:36:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12547 backedges. 0 proven. 5924 refuted. 0 times theorem prover too weak. 6623 trivial. 0 not checked. [2019-10-02 14:36:45,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:36:45,099 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:36:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:36:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:36:45,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 14:36:45,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:36:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12547 backedges. 4764 proven. 1156 refuted. 0 times theorem prover too weak. 6627 trivial. 0 not checked. [2019-10-02 14:36:45,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:36:45,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-02 14:36:45,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 14:36:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 14:36:45,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:36:45,406 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand 38 states. [2019-10-02 14:36:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:36:45,545 INFO L93 Difference]: Finished difference Result 329 states and 339 transitions. [2019-10-02 14:36:45,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 14:36:45,545 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 352 [2019-10-02 14:36:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:36:45,547 INFO L225 Difference]: With dead ends: 329 [2019-10-02 14:36:45,547 INFO L226 Difference]: Without dead ends: 210 [2019-10-02 14:36:45,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:36:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-02 14:36:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-10-02 14:36:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-02 14:36:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-02 14:36:45,554 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 352 [2019-10-02 14:36:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:36:45,555 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-02 14:36:45,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 14:36:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-02 14:36:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 14:36:45,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:36:45,559 INFO L411 BasicCegarLoop]: trace histogram [105, 105, 40, 40, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:36:45,560 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:36:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:36:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1889812111, now seen corresponding path program 62 times [2019-10-02 14:36:45,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:36:45,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:36:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:36:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:36:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13174 backedges. 0 proven. 6273 refuted. 0 times theorem prover too weak. 6901 trivial. 0 not checked. [2019-10-02 14:36:46,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:36:46,351 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:36:46,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:36:46,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:36:46,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:36:46,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:36:46,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:36:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13174 backedges. 5044 proven. 1225 refuted. 0 times theorem prover too weak. 6905 trivial. 0 not checked. [2019-10-02 14:36:46,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:36:46,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-02 14:36:46,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 14:36:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 14:36:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:36:46,668 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 39 states. [2019-10-02 14:36:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:36:46,819 INFO L93 Difference]: Finished difference Result 333 states and 343 transitions. [2019-10-02 14:36:46,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:36:46,819 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 358 [2019-10-02 14:36:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:36:46,821 INFO L225 Difference]: With dead ends: 333 [2019-10-02 14:36:46,822 INFO L226 Difference]: Without dead ends: 212 [2019-10-02 14:36:46,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:36:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-02 14:36:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-10-02 14:36:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-02 14:36:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2019-10-02 14:36:46,828 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 358 [2019-10-02 14:36:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:36:46,828 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2019-10-02 14:36:46,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 14:36:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2019-10-02 14:36:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-02 14:36:46,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:36:46,831 INFO L411 BasicCegarLoop]: trace histogram [108, 108, 40, 40, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:36:46,831 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:36:46,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:36:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1468498321, now seen corresponding path program 63 times [2019-10-02 14:36:46,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:36:46,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:36:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:46,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:36:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:36:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13819 backedges. 0 proven. 6632 refuted. 0 times theorem prover too weak. 7187 trivial. 0 not checked. [2019-10-02 14:36:47,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:36:47,664 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:36:47,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:36:51,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-10-02 14:36:51,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:36:51,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 14:36:51,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:36:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13819 backedges. 5338 proven. 324 refuted. 0 times theorem prover too weak. 8157 trivial. 0 not checked. [2019-10-02 14:36:51,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:36:51,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21] total 58 [2019-10-02 14:36:51,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-02 14:36:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-02 14:36:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=2356, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 14:36:51,537 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 58 states. [2019-10-02 14:36:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:36:51,802 INFO L93 Difference]: Finished difference Result 340 states and 351 transitions. [2019-10-02 14:36:51,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 14:36:51,803 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 364 [2019-10-02 14:36:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:36:51,804 INFO L225 Difference]: With dead ends: 340 [2019-10-02 14:36:51,804 INFO L226 Difference]: Without dead ends: 217 [2019-10-02 14:36:51,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=950, Invalid=2356, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 14:36:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-02 14:36:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-02 14:36:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-02 14:36:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-10-02 14:36:51,810 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 364 [2019-10-02 14:36:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:36:51,811 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-10-02 14:36:51,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-02 14:36:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-10-02 14:36:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-10-02 14:36:51,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:36:51,813 INFO L411 BasicCegarLoop]: trace histogram [111, 111, 40, 40, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:36:51,814 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:36:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:36:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1856168981, now seen corresponding path program 64 times [2019-10-02 14:36:51,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:36:51,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:36:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:51,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:36:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:36:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 14519 backedges. 0 proven. 7001 refuted. 0 times theorem prover too weak. 7518 trivial. 0 not checked. [2019-10-02 14:36:52,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:36:52,556 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:36:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:36:52,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:36:52,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:36:52,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 14:36:52,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:36:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14519 backedges. 5632 proven. 1369 refuted. 0 times theorem prover too weak. 7518 trivial. 0 not checked. [2019-10-02 14:36:52,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:36:52,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-02 14:36:52,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:36:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:36:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:36:52,901 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 41 states. [2019-10-02 14:36:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:36:53,012 INFO L93 Difference]: Finished difference Result 345 states and 355 transitions. [2019-10-02 14:36:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:36:53,012 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 372 [2019-10-02 14:36:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:36:53,013 INFO L225 Difference]: With dead ends: 345 [2019-10-02 14:36:53,014 INFO L226 Difference]: Without dead ends: 218 [2019-10-02 14:36:53,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:36:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-02 14:36:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-10-02 14:36:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-02 14:36:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2019-10-02 14:36:53,019 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 372 [2019-10-02 14:36:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:36:53,020 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2019-10-02 14:36:53,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:36:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2019-10-02 14:36:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-10-02 14:36:53,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:36:53,023 INFO L411 BasicCegarLoop]: trace histogram [114, 114, 40, 40, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:36:53,023 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:36:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:36:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash 238171241, now seen corresponding path program 65 times [2019-10-02 14:36:53,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:36:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:36:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:53,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:36:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:36:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:36:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15200 backedges. 0 proven. 7380 refuted. 0 times theorem prover too weak. 7820 trivial. 0 not checked. [2019-10-02 14:36:53,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:36:53,816 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:36:53,922 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:39:06,766 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-10-02 14:39:06,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:39:06,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 14:39:06,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:39:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15200 backedges. 5932 proven. 1444 refuted. 0 times theorem prover too weak. 7824 trivial. 0 not checked. [2019-10-02 14:39:06,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:39:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-02 14:39:06,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:39:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:39:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:39:06,888 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand 42 states. [2019-10-02 14:39:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:39:07,010 INFO L93 Difference]: Finished difference Result 349 states and 359 transitions. [2019-10-02 14:39:07,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:39:07,010 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 378 [2019-10-02 14:39:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:39:07,011 INFO L225 Difference]: With dead ends: 349 [2019-10-02 14:39:07,011 INFO L226 Difference]: Without dead ends: 220 [2019-10-02 14:39:07,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:39:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-02 14:39:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-10-02 14:39:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-02 14:39:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-10-02 14:39:07,017 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 378 [2019-10-02 14:39:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:39:07,017 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-10-02 14:39:07,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:39:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-10-02 14:39:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-10-02 14:39:07,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:39:07,020 INFO L411 BasicCegarLoop]: trace histogram [117, 117, 40, 40, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:39:07,020 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:39:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:39:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1582156185, now seen corresponding path program 66 times [2019-10-02 14:39:07,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:39:07,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:39:07,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:07,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:39:07,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:39:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15899 backedges. 0 proven. 7769 refuted. 0 times theorem prover too weak. 8130 trivial. 0 not checked. [2019-10-02 14:39:07,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:39:07,862 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:39:07,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:39:12,106 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-10-02 14:39:12,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:39:12,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 14:39:12,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:39:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 15899 backedges. 6250 proven. 361 refuted. 0 times theorem prover too weak. 9288 trivial. 0 not checked. [2019-10-02 14:39:12,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:39:12,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 22] total 62 [2019-10-02 14:39:12,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-02 14:39:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-02 14:39:12,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=2691, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 14:39:12,617 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 62 states. [2019-10-02 14:39:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:39:12,849 INFO L93 Difference]: Finished difference Result 355 states and 366 transitions. [2019-10-02 14:39:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-02 14:39:12,849 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 384 [2019-10-02 14:39:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:39:12,851 INFO L225 Difference]: With dead ends: 355 [2019-10-02 14:39:12,851 INFO L226 Difference]: Without dead ends: 224 [2019-10-02 14:39:12,853 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1091, Invalid=2691, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 14:39:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-02 14:39:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-02 14:39:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-02 14:39:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-02 14:39:12,859 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 384 [2019-10-02 14:39:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:39:12,859 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-02 14:39:12,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-02 14:39:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-02 14:39:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-02 14:39:12,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:39:12,862 INFO L411 BasicCegarLoop]: trace histogram [120, 120, 40, 40, 20, 20, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:39:12,862 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:39:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:39:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash 913853155, now seen corresponding path program 67 times [2019-10-02 14:39:12,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:39:12,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:39:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:12,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:39:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:39:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16655 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 16255 trivial. 0 not checked. [2019-10-02 14:39:13,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:39:13,267 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:39:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:39:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:39:13,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:39:13,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:39:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16655 backedges. 6570 proven. 400 refuted. 0 times theorem prover too weak. 9685 trivial. 0 not checked. [2019-10-02 14:39:13,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:39:13,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 14:39:13,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:39:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:39:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:39:13,606 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 24 states. [2019-10-02 14:39:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:39:13,684 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2019-10-02 14:39:13,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:39:13,685 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 392 [2019-10-02 14:39:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:39:13,687 INFO L225 Difference]: With dead ends: 317 [2019-10-02 14:39:13,687 INFO L226 Difference]: Without dead ends: 226 [2019-10-02 14:39:13,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:39:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-02 14:39:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-02 14:39:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-02 14:39:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-02 14:39:13,692 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 392 [2019-10-02 14:39:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:39:13,693 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-02 14:39:13,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:39:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-02 14:39:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-10-02 14:39:13,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:39:13,696 INFO L411 BasicCegarLoop]: trace histogram [120, 120, 40, 40, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:39:13,696 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:39:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:39:13,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1949119391, now seen corresponding path program 68 times [2019-10-02 14:39:13,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:39:13,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:39:13,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:13,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:39:13,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:39:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16696 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 16255 trivial. 0 not checked. [2019-10-02 14:39:14,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:39:14,187 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:39:14,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:39:14,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:39:14,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:39:14,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:39:14,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:39:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16696 backedges. 6570 proven. 441 refuted. 0 times theorem prover too weak. 9685 trivial. 0 not checked. [2019-10-02 14:39:14,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:39:14,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-02 14:39:14,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:39:14,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:39:14,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:39:14,531 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 25 states. [2019-10-02 14:39:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:39:14,601 INFO L93 Difference]: Finished difference Result 319 states and 324 transitions. [2019-10-02 14:39:14,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:39:14,603 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 394 [2019-10-02 14:39:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:39:14,605 INFO L225 Difference]: With dead ends: 319 [2019-10-02 14:39:14,605 INFO L226 Difference]: Without dead ends: 228 [2019-10-02 14:39:14,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:39:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-02 14:39:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-10-02 14:39:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-02 14:39:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2019-10-02 14:39:14,611 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 394 [2019-10-02 14:39:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:39:14,611 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2019-10-02 14:39:14,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:39:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2019-10-02 14:39:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-10-02 14:39:14,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:39:14,614 INFO L411 BasicCegarLoop]: trace histogram [120, 120, 40, 40, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:39:14,615 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:39:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:39:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -191699361, now seen corresponding path program 69 times [2019-10-02 14:39:14,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:39:14,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:39:14,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:14,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:39:14,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:39:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16739 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 16255 trivial. 0 not checked. [2019-10-02 14:39:15,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:39:15,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:39:15,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:39:28,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-02 14:39:28,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:39:28,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:39:28,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:39:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 16739 backedges. 6570 proven. 484 refuted. 0 times theorem prover too weak. 9685 trivial. 0 not checked. [2019-10-02 14:39:28,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:39:28,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 14:39:28,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:39:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:39:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:39:28,812 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 26 states. [2019-10-02 14:39:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:39:28,888 INFO L93 Difference]: Finished difference Result 321 states and 326 transitions. [2019-10-02 14:39:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:39:28,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 396 [2019-10-02 14:39:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:39:28,891 INFO L225 Difference]: With dead ends: 321 [2019-10-02 14:39:28,891 INFO L226 Difference]: Without dead ends: 230 [2019-10-02 14:39:28,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:39:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-02 14:39:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-10-02 14:39:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-02 14:39:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-02 14:39:28,897 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 396 [2019-10-02 14:39:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:39:28,898 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-02 14:39:28,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:39:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-02 14:39:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-02 14:39:28,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:39:28,901 INFO L411 BasicCegarLoop]: trace histogram [120, 120, 40, 40, 23, 23, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:39:28,901 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:39:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:39:28,902 INFO L82 PathProgramCache]: Analyzing trace with hash 766802141, now seen corresponding path program 70 times [2019-10-02 14:39:28,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:39:28,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:39:28,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:28,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:39:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:39:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16784 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 16255 trivial. 0 not checked. [2019-10-02 14:39:29,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:39:29,404 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:39:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:39:29,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:39:29,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:39:29,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:39:29,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:39:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16784 backedges. 6570 proven. 529 refuted. 0 times theorem prover too weak. 9685 trivial. 0 not checked. [2019-10-02 14:39:29,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:39:29,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-02 14:39:29,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:39:29,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:39:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:39:29,752 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 27 states. [2019-10-02 14:39:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:39:29,821 INFO L93 Difference]: Finished difference Result 323 states and 328 transitions. [2019-10-02 14:39:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:39:29,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 398 [2019-10-02 14:39:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:39:29,823 INFO L225 Difference]: With dead ends: 323 [2019-10-02 14:39:29,823 INFO L226 Difference]: Without dead ends: 232 [2019-10-02 14:39:29,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:39:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-02 14:39:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-10-02 14:39:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-02 14:39:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2019-10-02 14:39:29,830 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 398 [2019-10-02 14:39:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:39:29,831 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2019-10-02 14:39:29,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:39:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2019-10-02 14:39:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-02 14:39:29,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:39:29,834 INFO L411 BasicCegarLoop]: trace histogram [120, 120, 40, 40, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:39:29,834 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:39:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:39:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1531223077, now seen corresponding path program 71 times [2019-10-02 14:39:29,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:39:29,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:39:29,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:29,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:39:29,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:39:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:39:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16831 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 16255 trivial. 0 not checked. [2019-10-02 14:39:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:39:30,494 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:39:30,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1