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/max40-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:27:49,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:27:49,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:27:49,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:27:49,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:27:49,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:27:49,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:27:49,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:27:49,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:27:49,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:27:49,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:27:49,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:27:49,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:27:49,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:27:49,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:27:49,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:27:49,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:27:49,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:27:49,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:27:49,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:27:49,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:27:49,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:27:49,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:27:49,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:27:49,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:27:49,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:27:49,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:27:49,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:27:49,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:27:49,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:27:49,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:27:49,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:27:49,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:27:49,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:27:49,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:27:49,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:27:49,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:27:49,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:27:49,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:27:49,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:27:49,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:27:49,616 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:49,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:27:49,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:27:49,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:27:49,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:27:49,648 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:27:49,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:27:49,649 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:27:49,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:27:49,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:27:49,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:27:49,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:27:49,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:27:49,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:27:49,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:27:49,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:27:49,652 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:27:49,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:27:49,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:27:49,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:27:49,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:27:49,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:27:49,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:49,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:27:49,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:27:49,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:27:49,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:27:49,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:27:49,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:27:49,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:27:49,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:27:49,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:27:49,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:27:49,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:27:49,712 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:27:49,713 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max40-1.i [2019-10-02 14:27:49,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529abd835/f82271e977d54c6381230ef5cd5d4672/FLAG951bd7f4d [2019-10-02 14:27:50,239 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:27:50,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max40-1.i [2019-10-02 14:27:50,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529abd835/f82271e977d54c6381230ef5cd5d4672/FLAG951bd7f4d [2019-10-02 14:27:50,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529abd835/f82271e977d54c6381230ef5cd5d4672 [2019-10-02 14:27:50,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:27:50,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:27:50,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:50,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:27:50,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:27:50,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:50" (1/1) ... [2019-10-02 14:27:50,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca28fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:50, skipping insertion in model container [2019-10-02 14:27:50,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:50" (1/1) ... [2019-10-02 14:27:50,628 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:27:50,647 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:50,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:50,896 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:50,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:51,018 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:51,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:51 WrapperNode [2019-10-02 14:27:51,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:51,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:51,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:51,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:51,032 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:51" (1/1) ... [2019-10-02 14:27:51,032 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:51" (1/1) ... [2019-10-02 14:27:51,040 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:51" (1/1) ... [2019-10-02 14:27:51,040 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:51" (1/1) ... [2019-10-02 14:27:51,049 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:51" (1/1) ... [2019-10-02 14:27:51,055 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:51" (1/1) ... [2019-10-02 14:27:51,056 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:51" (1/1) ... [2019-10-02 14:27:51,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:51,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:51,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:51,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:51,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:51" (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:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-10-02 14:27:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:27:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:51,423 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:51,423 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 14:27:51,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:51 BoogieIcfgContainer [2019-10-02 14:27:51,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:51,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:51,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:51,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:51,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:27:50" (1/3) ... [2019-10-02 14:27:51,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695f3f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:51, skipping insertion in model container [2019-10-02 14:27:51,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:51" (2/3) ... [2019-10-02 14:27:51,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695f3f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:51, skipping insertion in model container [2019-10-02 14:27:51,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:51" (3/3) ... [2019-10-02 14:27:51,436 INFO L109 eAbstractionObserver]: Analyzing ICFG max40-1.i [2019-10-02 14:27:51,448 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:51,460 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:51,505 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:51,561 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:51,563 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:51,563 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:51,563 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:51,563 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:51,563 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:51,564 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:51,564 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:51,564 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-02 14:27:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:27:51,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:51,615 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:51,618 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:51,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1379671032, now seen corresponding path program 1 times [2019-10-02 14:27:51,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:51,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:51,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:51,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:51,915 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:51,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:51,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:51,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:51,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:51,939 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-10-02 14:27:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:51,992 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-02 14:27:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:51,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:27:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:52,004 INFO L225 Difference]: With dead ends: 60 [2019-10-02 14:27:52,005 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 14:27:52,009 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:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 14:27:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-02 14:27:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 14:27:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-02 14:27:52,054 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2019-10-02 14:27:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:52,054 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-02 14:27:52,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-02 14:27:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:27:52,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:52,057 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:52,058 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash 551744077, now seen corresponding path program 1 times [2019-10-02 14:27:52,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:52,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:52,179 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:52,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:52,180 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:52,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:52,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:27:52,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:52,310 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:52,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:27:52,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 14:27:52,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:52,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:52,331 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2019-10-02 14:27:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:52,376 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-10-02 14:27:52,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:52,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-02 14:27:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:52,379 INFO L225 Difference]: With dead ends: 52 [2019-10-02 14:27:52,379 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 14:27:52,381 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:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 14:27:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-02 14:27:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 14:27:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-02 14:27:52,397 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2019-10-02 14:27:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:52,398 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-02 14:27:52,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-02 14:27:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 14:27:52,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:52,403 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:52,403 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash 727331048, now seen corresponding path program 1 times [2019-10-02 14:27:52,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:52,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:52,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:52,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:52,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:52,502 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 3 states. [2019-10-02 14:27:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:52,521 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-02 14:27:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:52,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 14:27:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:52,524 INFO L225 Difference]: With dead ends: 47 [2019-10-02 14:27:52,524 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 14:27:52,525 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:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 14:27:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-02 14:27:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 14:27:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-02 14:27:52,532 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 46 [2019-10-02 14:27:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:52,535 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-02 14:27:52,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-02 14:27:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 14:27:52,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:52,537 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, 1, 1] [2019-10-02 14:27:52,537 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash -270429754, now seen corresponding path program 1 times [2019-10-02 14:27:52,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:52,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:52,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:52,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:52,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:52,687 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:52,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:52,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:52,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:52,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:52,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:27:52,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:52,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:52,842 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-10-02 14:27:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:52,866 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-02 14:27:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:27:52,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-02 14:27:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:52,868 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:27:52,868 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 14:27:52,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 14:27:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-02 14:27:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 14:27:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-02 14:27:52,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 48 [2019-10-02 14:27:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:52,875 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-02 14:27:52,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-02 14:27:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 14:27:52,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:52,877 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:52,877 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:52,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1585951496, now seen corresponding path program 2 times [2019-10-02 14:27:52,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:52,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:52,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:52,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:52,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:52,985 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:53,012 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:53,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:53,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:53,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:53,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:53,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:53,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:27:53,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:27:53,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:27:53,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:53,082 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 6 states. [2019-10-02 14:27:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:53,114 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-10-02 14:27:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:53,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-02 14:27:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:53,116 INFO L225 Difference]: With dead ends: 58 [2019-10-02 14:27:53,116 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 14:27:53,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 14:27:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-02 14:27:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 14:27:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-10-02 14:27:53,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 50 [2019-10-02 14:27:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:53,124 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-02 14:27:53,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:27:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-10-02 14:27:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:27:53,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:53,125 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:53,126 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1138062390, now seen corresponding path program 3 times [2019-10-02 14:27:53,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:53,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:53,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:53,215 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:53,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:53,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 14:27:53,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:53,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:53,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 14:27:53,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:53,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 14:27:53,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:53,307 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2019-10-02 14:27:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:53,392 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-10-02 14:27:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:27:53,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-10-02 14:27:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:53,396 INFO L225 Difference]: With dead ends: 67 [2019-10-02 14:27:53,396 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 14:27:53,397 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 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:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 14:27:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-10-02 14:27:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 14:27:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-02 14:27:53,412 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 52 [2019-10-02 14:27:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:53,413 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-02 14:27:53,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-02 14:27:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:27:53,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:53,416 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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:53,416 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash 454933031, now seen corresponding path program 4 times [2019-10-02 14:27:53,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:53,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:53,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:53,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:27:53,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:53,520 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) [2019-10-02 14:27:53,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:53,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:53,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:53,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:27:53,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:27:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 14:27:53,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:53,649 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 8 states. [2019-10-02 14:27:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:53,690 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2019-10-02 14:27:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 14:27:53,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-10-02 14:27:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:53,693 INFO L225 Difference]: With dead ends: 70 [2019-10-02 14:27:53,693 INFO L226 Difference]: Without dead ends: 44 [2019-10-02 14:27:53,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 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:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-02 14:27:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-10-02 14:27:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 14:27:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-10-02 14:27:53,704 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 66 [2019-10-02 14:27:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:53,704 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-10-02 14:27:53,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-10-02 14:27:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:27:53,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:53,706 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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:53,706 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1758121705, now seen corresponding path program 5 times [2019-10-02 14:27:53,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:53,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:27:53,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:53,849 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:53,881 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:27:53,947 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 14:27:53,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:53,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:53,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:53,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:53,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 14:27:53,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:53,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:53,996 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 11 states. [2019-10-02 14:27:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:54,069 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2019-10-02 14:27:54,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:54,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-02 14:27:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:54,071 INFO L225 Difference]: With dead ends: 79 [2019-10-02 14:27:54,071 INFO L226 Difference]: Without dead ends: 53 [2019-10-02 14:27:54,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 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:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-02 14:27:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-10-02 14:27:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 14:27:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-10-02 14:27:54,085 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 68 [2019-10-02 14:27:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:54,088 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-10-02 14:27:54,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-10-02 14:27:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 14:27:54,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:54,090 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 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:54,091 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1391411910, now seen corresponding path program 6 times [2019-10-02 14:27:54,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:54,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:54,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:54,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 14:27:54,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:54,257 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:54,280 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:54,335 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 14:27:54,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:54,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:54,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 14:27:54,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:54,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-02 14:27:54,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:54,393 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 11 states. [2019-10-02 14:27:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:54,480 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-10-02 14:27:54,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:54,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-10-02 14:27:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:54,482 INFO L225 Difference]: With dead ends: 85 [2019-10-02 14:27:54,482 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 14:27:54,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 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:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 14:27:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-10-02 14:27:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 14:27:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-10-02 14:27:54,498 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 82 [2019-10-02 14:27:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:54,498 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-10-02 14:27:54,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-10-02 14:27:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 14:27:54,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:54,505 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 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:54,505 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 197997542, now seen corresponding path program 7 times [2019-10-02 14:27:54,506 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:54,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:54,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-02 14:27:54,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:54,672 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) [2019-10-02 14:27:54,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:54,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:27:54,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-02 14:27:54,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:54,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:27:54,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:27:54,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:27:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:27:54,822 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 11 states. [2019-10-02 14:27:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:54,861 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-10-02 14:27:54,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:54,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-10-02 14:27:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:54,863 INFO L225 Difference]: With dead ends: 88 [2019-10-02 14:27:54,863 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 14:27:54,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 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:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 14:27:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-02 14:27:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 14:27:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-10-02 14:27:54,870 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 86 [2019-10-02 14:27:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:54,870 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-10-02 14:27:54,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:27:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-10-02 14:27:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 14:27:54,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:54,871 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 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:54,872 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:54,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1074942888, now seen corresponding path program 8 times [2019-10-02 14:27:54,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:54,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:54,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-02 14:27:54,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:54,988 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:55,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:55,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:55,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:55,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:27:55,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:55,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:55,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:27:55,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:27:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:27:55,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:27:55,094 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 12 states. [2019-10-02 14:27:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:55,145 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-10-02 14:27:55,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:55,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-10-02 14:27:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:55,147 INFO L225 Difference]: With dead ends: 90 [2019-10-02 14:27:55,147 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 14:27:55,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 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:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 14:27:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-02 14:27:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 14:27:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-10-02 14:27:55,160 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 88 [2019-10-02 14:27:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:55,164 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-10-02 14:27:55,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:27:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-10-02 14:27:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 14:27:55,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:55,167 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 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:55,168 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:55,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2005830378, now seen corresponding path program 9 times [2019-10-02 14:27:55,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:55,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-02 14:27:55,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:55,305 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:55,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:55,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 14:27:55,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:55,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:55,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 94 proven. 4 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-10-02 14:27:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:55,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 14:27:55,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:27:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:27:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:27:55,416 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 15 states. [2019-10-02 14:27:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:55,493 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-10-02 14:27:55,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:27:55,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-10-02 14:27:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:55,495 INFO L225 Difference]: With dead ends: 95 [2019-10-02 14:27:55,495 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 14:27:55,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:27:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 14:27:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-02 14:27:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 14:27:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-10-02 14:27:55,506 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 90 [2019-10-02 14:27:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:55,506 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-10-02 14:27:55,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:27:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-10-02 14:27:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 14:27:55,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:55,508 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 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:55,508 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1656201482, now seen corresponding path program 10 times [2019-10-02 14:27:55,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:55,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:55,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:55,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:55,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 14:27:55,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:55,667 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:55,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:55,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:55,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:55,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:27:55,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 14:27:55,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 14:27:55,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:27:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:27:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:27:55,824 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 14 states. [2019-10-02 14:27:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:55,868 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-10-02 14:27:55,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:27:55,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2019-10-02 14:27:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:55,871 INFO L225 Difference]: With dead ends: 98 [2019-10-02 14:27:55,871 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 14:27:55,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:27:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 14:27:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-02 14:27:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 14:27:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-10-02 14:27:55,887 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 94 [2019-10-02 14:27:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:55,887 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-10-02 14:27:55,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:27:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-10-02 14:27:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 14:27:55,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:55,888 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 9, 9, 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:55,889 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash 659152588, now seen corresponding path program 11 times [2019-10-02 14:27:55,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:55,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 14:27:56,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:56,059 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:56,082 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:27:56,323 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 14:27:56,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:56,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:27:56,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-02 14:27:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:56,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2019-10-02 14:27:56,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:27:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:27:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:27:56,404 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 18 states. [2019-10-02 14:27:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:56,495 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2019-10-02 14:27:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:27:56,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-10-02 14:27:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:56,497 INFO L225 Difference]: With dead ends: 107 [2019-10-02 14:27:56,497 INFO L226 Difference]: Without dead ends: 73 [2019-10-02 14:27:56,498 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:27:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-02 14:27:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-10-02 14:27:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-02 14:27:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-10-02 14:27:56,504 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 96 [2019-10-02 14:27:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:56,504 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-10-02 14:27:56,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:27:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-10-02 14:27:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 14:27:56,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:56,506 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 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:56,506 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1708395305, now seen corresponding path program 12 times [2019-10-02 14:27:56,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:56,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:56,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-02 14:27:56,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:56,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:56,872 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 14:27:56,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:56,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:27:56,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 154 proven. 9 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2019-10-02 14:27:57,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:57,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-02 14:27:57,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:27:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:27:57,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:27:57,010 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 19 states. [2019-10-02 14:27:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:57,098 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2019-10-02 14:27:57,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:27:57,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2019-10-02 14:27:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:57,105 INFO L225 Difference]: With dead ends: 113 [2019-10-02 14:27:57,105 INFO L226 Difference]: Without dead ends: 75 [2019-10-02 14:27:57,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:27:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-02 14:27:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-02 14:27:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-02 14:27:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-10-02 14:27:57,115 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 110 [2019-10-02 14:27:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:57,116 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-10-02 14:27:57,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:27:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-10-02 14:27:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 14:27:57,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:57,117 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 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:57,118 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -356697015, now seen corresponding path program 13 times [2019-10-02 14:27:57,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:57,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:57,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:57,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:57,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 14:27:57,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:57,309 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:57,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:57,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:27:57,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:57,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:57,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 14:27:57,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:27:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:27:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:27:57,422 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 17 states. [2019-10-02 14:27:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:57,476 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-10-02 14:27:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:27:57,478 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2019-10-02 14:27:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:57,479 INFO L225 Difference]: With dead ends: 116 [2019-10-02 14:27:57,479 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 14:27:57,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 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:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 14:27:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-02 14:27:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 14:27:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-10-02 14:27:57,483 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 114 [2019-10-02 14:27:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:57,484 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-10-02 14:27:57,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:27:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-10-02 14:27:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 14:27:57,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:57,485 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 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:57,486 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1330051829, now seen corresponding path program 14 times [2019-10-02 14:27:57,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:57,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:57,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:57,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:57,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 14:27:57,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:57,689 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) [2019-10-02 14:27:57,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:57,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:57,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:57,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:27:57,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 14:27:57,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:57,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 14:27:57,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:27:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:27:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:27:57,826 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 18 states. [2019-10-02 14:27:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:57,896 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2019-10-02 14:27:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:27:57,896 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 116 [2019-10-02 14:27:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:57,898 INFO L225 Difference]: With dead ends: 118 [2019-10-02 14:27:57,898 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 14:27:57,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 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:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 14:27:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-02 14:27:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 14:27:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2019-10-02 14:27:57,904 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 116 [2019-10-02 14:27:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:57,904 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2019-10-02 14:27:57,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:27:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2019-10-02 14:27:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 14:27:57,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:57,906 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 12, 12, 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:57,906 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash -421157555, now seen corresponding path program 15 times [2019-10-02 14:27:57,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:57,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:57,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 14:27:58,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:58,200 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:58,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:58,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 14:27:58,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:58,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:27:58,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 152 proven. 28 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-10-02 14:27:58,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:58,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-10-02 14:27:58,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:27:58,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:27:58,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:27:58,390 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 23 states. [2019-10-02 14:27:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:58,482 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2019-10-02 14:27:58,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:27:58,482 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 118 [2019-10-02 14:27:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:58,483 INFO L225 Difference]: With dead ends: 127 [2019-10-02 14:27:58,483 INFO L226 Difference]: Without dead ends: 87 [2019-10-02 14:27:58,484 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:27:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-02 14:27:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-10-02 14:27:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 14:27:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-10-02 14:27:58,489 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 118 [2019-10-02 14:27:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:58,490 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-10-02 14:27:58,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:27:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-10-02 14:27:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 14:27:58,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:58,492 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 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:58,492 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1792802646, now seen corresponding path program 16 times [2019-10-02 14:27:58,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:58,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:58,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-02 14:27:58,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:58,731 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:58,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:58,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:58,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:58,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:27:58,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-02 14:27:58,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 14:27:58,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:27:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:27:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:27:58,877 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 20 states. [2019-10-02 14:27:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:58,938 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2019-10-02 14:27:58,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:27:58,939 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2019-10-02 14:27:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:58,940 INFO L225 Difference]: With dead ends: 130 [2019-10-02 14:27:58,940 INFO L226 Difference]: Without dead ends: 86 [2019-10-02 14:27:58,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 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:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-02 14:27:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-10-02 14:27:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 14:27:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-10-02 14:27:58,946 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 132 [2019-10-02 14:27:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:58,947 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-10-02 14:27:58,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:27:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-10-02 14:27:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 14:27:58,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:58,949 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 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:58,949 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash -371467028, now seen corresponding path program 17 times [2019-10-02 14:27:58,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:58,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:58,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-02 14:27:59,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:59,214 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:59,255 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:28:00,011 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-02 14:28:00,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:00,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:28:00,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 224 proven. 45 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-10-02 14:28:00,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:00,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-10-02 14:28:00,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:28:00,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:28:00,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:28:00,127 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 26 states. [2019-10-02 14:28:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:00,262 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2019-10-02 14:28:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:28:00,262 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 134 [2019-10-02 14:28:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:00,263 INFO L225 Difference]: With dead ends: 139 [2019-10-02 14:28:00,264 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 14:28:00,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:28:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 14:28:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2019-10-02 14:28:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 14:28:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2019-10-02 14:28:00,269 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 134 [2019-10-02 14:28:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:00,269 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2019-10-02 14:28:00,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:28:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2019-10-02 14:28:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:28:00,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:00,271 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 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:28:00,271 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1660813879, now seen corresponding path program 18 times [2019-10-02 14:28:00,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:00,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:00,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2019-10-02 14:28:00,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:00,510 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:28:00,536 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:28:00,754 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-02 14:28:00,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:00,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:28:00,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 322 proven. 16 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2019-10-02 14:28:00,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:00,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-02 14:28:00,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:28:00,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:28:00,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:28:00,849 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 26 states. [2019-10-02 14:28:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:00,969 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2019-10-02 14:28:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:28:00,970 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 148 [2019-10-02 14:28:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:00,971 INFO L225 Difference]: With dead ends: 145 [2019-10-02 14:28:00,971 INFO L226 Difference]: Without dead ends: 97 [2019-10-02 14:28:00,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 144 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:28:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-02 14:28:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-10-02 14:28:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 14:28:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2019-10-02 14:28:00,976 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 148 [2019-10-02 14:28:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:00,976 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2019-10-02 14:28:00,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:28:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2019-10-02 14:28:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 14:28:00,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:00,977 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 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:28:00,978 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:00,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:00,978 INFO L82 PathProgramCache]: Analyzing trace with hash -462803735, now seen corresponding path program 19 times [2019-10-02 14:28:00,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:00,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:00,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-10-02 14:28:01,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:01,288 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:28:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:01,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:28:01,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-10-02 14:28:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:01,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 14:28:01,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:28:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:28:01,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:28:01,425 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 23 states. [2019-10-02 14:28:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:01,488 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2019-10-02 14:28:01,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:28:01,488 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 152 [2019-10-02 14:28:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:01,489 INFO L225 Difference]: With dead ends: 148 [2019-10-02 14:28:01,489 INFO L226 Difference]: Without dead ends: 98 [2019-10-02 14:28:01,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 152 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:28:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-02 14:28:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-10-02 14:28:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-02 14:28:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-10-02 14:28:01,495 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 152 [2019-10-02 14:28:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:01,495 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-10-02 14:28:01,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:28:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-10-02 14:28:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 14:28:01,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:01,497 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 18, 18, 18, 18, 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:28:01,497 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1779127339, now seen corresponding path program 20 times [2019-10-02 14:28:01,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:01,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:01,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:01,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-10-02 14:28:01,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:01,827 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:28:01,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:28:01,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:28:01,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:01,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:28:01,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:28:01,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:01,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 14:28:01,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:28:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:28:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:28:01,990 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 24 states. [2019-10-02 14:28:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:02,110 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2019-10-02 14:28:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:28:02,111 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2019-10-02 14:28:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:02,112 INFO L225 Difference]: With dead ends: 150 [2019-10-02 14:28:02,113 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 14:28:02,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 154 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:28:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 14:28:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-10-02 14:28:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 14:28:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-10-02 14:28:02,120 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 154 [2019-10-02 14:28:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:02,121 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-10-02 14:28:02,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:28:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-10-02 14:28:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 14:28:02,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:02,123 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 18, 18, 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:28:02,124 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:02,125 INFO L82 PathProgramCache]: Analyzing trace with hash 201306861, now seen corresponding path program 21 times [2019-10-02 14:28:02,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:02,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:02,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-10-02 14:28:02,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:02,555 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:28:02,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:28:02,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 14:28:02,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:02,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:28:02,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 322 proven. 25 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-02 14:28:02,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:02,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-02 14:28:02,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:28:02,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:28:02,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:28:02,861 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 30 states. [2019-10-02 14:28:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:03,000 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2019-10-02 14:28:03,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:28:03,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 156 [2019-10-02 14:28:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:03,002 INFO L225 Difference]: With dead ends: 155 [2019-10-02 14:28:03,002 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 14:28:03,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 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:28:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 14:28:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-02 14:28:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 14:28:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2019-10-02 14:28:03,010 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 156 [2019-10-02 14:28:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:03,010 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2019-10-02 14:28:03,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:28:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2019-10-02 14:28:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:28:03,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:03,011 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 18, 18, 18, 18, 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:28:03,012 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1557379315, now seen corresponding path program 22 times [2019-10-02 14:28:03,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:03,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:03,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:03,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:03,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2019-10-02 14:28:03,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:03,411 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:28:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:28:03,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:28:03,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:03,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:28:03,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 717 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:28:03,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:03,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 14:28:03,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:28:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:28:03,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:28:03,566 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 26 states. [2019-10-02 14:28:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:03,647 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2019-10-02 14:28:03,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:28:03,648 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 160 [2019-10-02 14:28:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:03,649 INFO L225 Difference]: With dead ends: 158 [2019-10-02 14:28:03,649 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 14:28:03,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 160 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:28:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 14:28:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-02 14:28:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-02 14:28:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-10-02 14:28:03,654 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 160 [2019-10-02 14:28:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:03,654 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-10-02 14:28:03,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:28:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-10-02 14:28:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 14:28:03,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:03,655 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 18, 18, 18, 18, 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:28:03,656 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1638200241, now seen corresponding path program 23 times [2019-10-02 14:28:03,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:03,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:03,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:03,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2019-10-02 14:28:04,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:04,080 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:28:04,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:28:07,095 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-02 14:28:07,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:07,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:28:07,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 316 proven. 66 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-02 14:28:07,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:07,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 33 [2019-10-02 14:28:07,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:28:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:28:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:28:07,243 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 33 states. [2019-10-02 14:28:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:07,362 INFO L93 Difference]: Finished difference Result 167 states and 193 transitions. [2019-10-02 14:28:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 14:28:07,362 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 162 [2019-10-02 14:28:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:07,363 INFO L225 Difference]: With dead ends: 167 [2019-10-02 14:28:07,363 INFO L226 Difference]: Without dead ends: 115 [2019-10-02 14:28:07,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:28:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-02 14:28:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-10-02 14:28:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-02 14:28:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-10-02 14:28:07,372 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 162 [2019-10-02 14:28:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:07,372 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-10-02 14:28:07,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:28:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-10-02 14:28:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 14:28:07,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:07,374 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 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:28:07,374 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1915017812, now seen corresponding path program 24 times [2019-10-02 14:28:07,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:07,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:07,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-10-02 14:28:07,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:07,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 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:28:07,883 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:28:08,524 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-02 14:28:08,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:08,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:28:08,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 430 proven. 36 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2019-10-02 14:28:08,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:08,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-02 14:28:08,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:28:08,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:28:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:28:08,655 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 34 states. [2019-10-02 14:28:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:08,804 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2019-10-02 14:28:08,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:28:08,804 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 176 [2019-10-02 14:28:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:08,805 INFO L225 Difference]: With dead ends: 173 [2019-10-02 14:28:08,805 INFO L226 Difference]: Without dead ends: 117 [2019-10-02 14:28:08,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 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:28:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-02 14:28:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-02 14:28:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-02 14:28:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-10-02 14:28:08,810 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 176 [2019-10-02 14:28:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:08,811 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-10-02 14:28:08,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:28:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-10-02 14:28:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 14:28:08,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:08,813 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 21, 21, 21, 21, 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:28:08,813 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash -664873780, now seen corresponding path program 25 times [2019-10-02 14:28:08,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:08,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:08,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:08,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-10-02 14:28:09,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:09,418 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:28:09,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:09,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:28:09,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:28:09,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:09,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 14:28:09,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:28:09,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:28:09,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:28:09,596 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 29 states. [2019-10-02 14:28:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:09,697 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2019-10-02 14:28:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:28:09,698 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 180 [2019-10-02 14:28:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:09,700 INFO L225 Difference]: With dead ends: 176 [2019-10-02 14:28:09,700 INFO L226 Difference]: Without dead ends: 118 [2019-10-02 14:28:09,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:28:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-02 14:28:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-10-02 14:28:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-02 14:28:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2019-10-02 14:28:09,707 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 180 [2019-10-02 14:28:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:09,707 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2019-10-02 14:28:09,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:28:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2019-10-02 14:28:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 14:28:09,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:09,710 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 21, 21, 21, 21, 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:28:09,710 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:09,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:09,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1692951822, now seen corresponding path program 26 times [2019-10-02 14:28:09,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:09,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:09,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:09,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1643 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-10-02 14:28:10,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:10,173 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:28:10,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:28:10,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:28:10,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:10,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:28:10,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1643 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-10-02 14:28:10,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:10,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 14:28:10,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:28:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:28:10,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:28:10,344 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 30 states. [2019-10-02 14:28:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:10,449 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2019-10-02 14:28:10,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 14:28:10,451 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 182 [2019-10-02 14:28:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:10,452 INFO L225 Difference]: With dead ends: 178 [2019-10-02 14:28:10,452 INFO L226 Difference]: Without dead ends: 120 [2019-10-02 14:28:10,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:28:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-02 14:28:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-10-02 14:28:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-02 14:28:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2019-10-02 14:28:10,462 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 182 [2019-10-02 14:28:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:10,462 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2019-10-02 14:28:10,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:28:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2019-10-02 14:28:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 14:28:10,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:10,464 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 21, 21, 21, 21, 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:28:10,464 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:10,465 INFO L82 PathProgramCache]: Analyzing trace with hash -179376944, now seen corresponding path program 27 times [2019-10-02 14:28:10,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:10,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1696 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-10-02 14:28:10,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:10,940 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:28:10,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:28:11,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 14:28:11,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:11,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:28:11,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1696 backedges. 428 proven. 91 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2019-10-02 14:28:11,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:11,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-02 14:28:11,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 14:28:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 14:28:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:28:11,322 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 38 states. [2019-10-02 14:28:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:11,484 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2019-10-02 14:28:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:28:11,484 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 184 [2019-10-02 14:28:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:11,486 INFO L225 Difference]: With dead ends: 187 [2019-10-02 14:28:11,486 INFO L226 Difference]: Without dead ends: 129 [2019-10-02 14:28:11,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:28:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-02 14:28:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2019-10-02 14:28:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-02 14:28:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2019-10-02 14:28:11,494 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 184 [2019-10-02 14:28:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:11,495 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2019-10-02 14:28:11,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 14:28:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2019-10-02 14:28:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 14:28:11,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:11,496 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 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:28:11,497 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1322478291, now seen corresponding path program 28 times [2019-10-02 14:28:11,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:11,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2024 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-10-02 14:28:12,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:12,023 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:28:12,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:28:12,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:28:12,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:12,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 14:28:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2024 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-10-02 14:28:12,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:12,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-02 14:28:12,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:28:12,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:28:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:28:12,220 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 32 states. [2019-10-02 14:28:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:12,320 INFO L93 Difference]: Finished difference Result 190 states and 214 transitions. [2019-10-02 14:28:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:28:12,320 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 198 [2019-10-02 14:28:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:12,321 INFO L225 Difference]: With dead ends: 190 [2019-10-02 14:28:12,322 INFO L226 Difference]: Without dead ends: 128 [2019-10-02 14:28:12,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 198 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:28:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-02 14:28:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-02 14:28:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-02 14:28:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2019-10-02 14:28:12,327 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 198 [2019-10-02 14:28:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:12,327 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2019-10-02 14:28:12,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:28:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2019-10-02 14:28:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 14:28:12,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:12,329 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 24, 24, 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:28:12,329 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1784633583, now seen corresponding path program 29 times [2019-10-02 14:28:12,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:12,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:12,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:12,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:12,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-10-02 14:28:12,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:12,995 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:28:13,034 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:28:22,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-02 14:28:22,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:22,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:28:22,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 548 proven. 120 refuted. 0 times theorem prover too weak. 1413 trivial. 0 not checked. [2019-10-02 14:28:22,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:22,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2019-10-02 14:28:22,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:28:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:28:22,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:28:22,756 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand 41 states. [2019-10-02 14:28:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:22,941 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2019-10-02 14:28:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:28:22,942 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-02 14:28:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:22,943 INFO L225 Difference]: With dead ends: 199 [2019-10-02 14:28:22,943 INFO L226 Difference]: Without dead ends: 137 [2019-10-02 14:28:22,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:28:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-02 14:28:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-10-02 14:28:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-02 14:28:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2019-10-02 14:28:22,950 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 200 [2019-10-02 14:28:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:22,951 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2019-10-02 14:28:22,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:28:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2019-10-02 14:28:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 14:28:22,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:22,952 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 27, 27, 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:28:22,952 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash 537609932, now seen corresponding path program 30 times [2019-10-02 14:28:22,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:22,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:22,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2019-10-02 14:28:23,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:23,487 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:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:28:24,486 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-02 14:28:24,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:24,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:28:24,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 694 proven. 49 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2019-10-02 14:28:24,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:24,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 10] total 41 [2019-10-02 14:28:24,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:28:24,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:28:24,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1068, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:28:24,693 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 41 states. [2019-10-02 14:28:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:24,886 INFO L93 Difference]: Finished difference Result 205 states and 232 transitions. [2019-10-02 14:28:24,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:28:24,890 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 214 [2019-10-02 14:28:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:24,891 INFO L225 Difference]: With dead ends: 205 [2019-10-02 14:28:24,891 INFO L226 Difference]: Without dead ends: 139 [2019-10-02 14:28:24,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=1068, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:28:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-02 14:28:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-02 14:28:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-02 14:28:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2019-10-02 14:28:24,899 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 214 [2019-10-02 14:28:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:24,899 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2019-10-02 14:28:24,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:28:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2019-10-02 14:28:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 14:28:24,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:24,901 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 27, 27, 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:28:24,901 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash -893160468, now seen corresponding path program 31 times [2019-10-02 14:28:24,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:24,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2019-10-02 14:28:25,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:25,719 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:25,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:25,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:28:25,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2019-10-02 14:28:25,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:25,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-02 14:28:25,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 14:28:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 14:28:25,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:28:25,910 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 35 states. [2019-10-02 14:28:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:26,032 INFO L93 Difference]: Finished difference Result 208 states and 234 transitions. [2019-10-02 14:28:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:28:26,032 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 218 [2019-10-02 14:28:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:26,034 INFO L225 Difference]: With dead ends: 208 [2019-10-02 14:28:26,034 INFO L226 Difference]: Without dead ends: 140 [2019-10-02 14:28:26,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 218 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:28:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-02 14:28:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-10-02 14:28:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-02 14:28:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2019-10-02 14:28:26,039 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 218 [2019-10-02 14:28:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:26,040 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2019-10-02 14:28:26,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 14:28:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2019-10-02 14:28:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 14:28:26,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:26,041 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 27, 27, 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:28:26,042 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash 98615982, now seen corresponding path program 32 times [2019-10-02 14:28:26,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:26,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:26,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2019-10-02 14:28:26,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:26,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 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:26,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:28:26,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:28:26,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:26,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:28:26,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:28:26,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:26,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:28:26,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:28:26,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:28:26,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:28:26,879 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 36 states. [2019-10-02 14:28:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:26,987 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2019-10-02 14:28:26,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:28:26,987 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 220 [2019-10-02 14:28:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:26,989 INFO L225 Difference]: With dead ends: 210 [2019-10-02 14:28:26,989 INFO L226 Difference]: Without dead ends: 142 [2019-10-02 14:28:26,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:28:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-02 14:28:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-10-02 14:28:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-02 14:28:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2019-10-02 14:28:26,998 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 220 [2019-10-02 14:28:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:26,999 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2019-10-02 14:28:26,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:28:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2019-10-02 14:28:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 14:28:27,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:27,001 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 27, 27, 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:28:27,001 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash -286955280, now seen corresponding path program 33 times [2019-10-02 14:28:27,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:27,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:27,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:27,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:27,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2019-10-02 14:28:27,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:27,595 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:27,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:28:27,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 14:28:27,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:27,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:28:28,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 694 proven. 64 refuted. 0 times theorem prover too weak. 1895 trivial. 0 not checked. [2019-10-02 14:28:28,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:28,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 11] total 45 [2019-10-02 14:28:28,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 14:28:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 14:28:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=684, Invalid=1296, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:28:28,188 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand 45 states. [2019-10-02 14:28:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:28,406 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2019-10-02 14:28:28,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 14:28:28,406 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 222 [2019-10-02 14:28:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:28,407 INFO L225 Difference]: With dead ends: 215 [2019-10-02 14:28:28,407 INFO L226 Difference]: Without dead ends: 147 [2019-10-02 14:28:28,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=684, Invalid=1296, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:28:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-02 14:28:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-02 14:28:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-02 14:28:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2019-10-02 14:28:28,413 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 222 [2019-10-02 14:28:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:28,414 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2019-10-02 14:28:28,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 14:28:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2019-10-02 14:28:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 14:28:28,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:28,416 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 27, 27, 27, 27, 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:28,417 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 87767824, now seen corresponding path program 34 times [2019-10-02 14:28:28,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:28,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:28,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:28,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:28,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2737 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1581 trivial. 0 not checked. [2019-10-02 14:28:29,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:29,160 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:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:28:29,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:28:29,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:29,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 14:28:29,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2737 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1581 trivial. 0 not checked. [2019-10-02 14:28:29,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:29,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-02 14:28:29,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 14:28:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 14:28:29,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:28:29,382 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 38 states. [2019-10-02 14:28:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:29,502 INFO L93 Difference]: Finished difference Result 218 states and 244 transitions. [2019-10-02 14:28:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 14:28:29,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 226 [2019-10-02 14:28:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:29,504 INFO L225 Difference]: With dead ends: 218 [2019-10-02 14:28:29,504 INFO L226 Difference]: Without dead ends: 148 [2019-10-02 14:28:29,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:28:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-02 14:28:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-02 14:28:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-02 14:28:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2019-10-02 14:28:29,510 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 226 [2019-10-02 14:28:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:29,512 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2019-10-02 14:28:29,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 14:28:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2019-10-02 14:28:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 14:28:29,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:29,514 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 27, 27, 27, 27, 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:29,514 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 151431122, now seen corresponding path program 35 times [2019-10-02 14:28:29,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:29,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:29,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:29,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:29,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2806 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1581 trivial. 0 not checked. [2019-10-02 14:28:30,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:30,154 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:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:29:19,831 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-02 14:29:19,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:19,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:29:19,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2806 backedges. 688 proven. 153 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2019-10-02 14:29:20,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:20,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 12] total 48 [2019-10-02 14:29:20,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 14:29:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 14:29:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=1488, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:29:20,145 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand 48 states. [2019-10-02 14:29:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:20,385 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2019-10-02 14:29:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 14:29:20,387 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-02 14:29:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:20,388 INFO L225 Difference]: With dead ends: 227 [2019-10-02 14:29:20,389 INFO L226 Difference]: Without dead ends: 157 [2019-10-02 14:29:20,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=768, Invalid=1488, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:29:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-02 14:29:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-10-02 14:29:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-02 14:29:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2019-10-02 14:29:20,395 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 228 [2019-10-02 14:29:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:20,397 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2019-10-02 14:29:20,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 14:29:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2019-10-02 14:29:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 14:29:20,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:20,398 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 30, 30, 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:29:20,399 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash 958451247, now seen corresponding path program 36 times [2019-10-02 14:29:20,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:20,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:20,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-10-02 14:29:21,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:21,228 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:21,277 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:29:22,650 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-02 14:29:22,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:22,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:29:22,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 850 proven. 81 refuted. 0 times theorem prover too weak. 2291 trivial. 0 not checked. [2019-10-02 14:29:22,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 12] total 49 [2019-10-02 14:29:22,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-02 14:29:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-02 14:29:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=1546, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:29:22,896 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand 49 states. [2019-10-02 14:29:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:23,113 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2019-10-02 14:29:23,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 14:29:23,114 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 242 [2019-10-02 14:29:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:23,115 INFO L225 Difference]: With dead ends: 233 [2019-10-02 14:29:23,115 INFO L226 Difference]: Without dead ends: 159 [2019-10-02 14:29:23,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=806, Invalid=1546, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 14:29:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-02 14:29:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-02 14:29:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-02 14:29:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2019-10-02 14:29:23,123 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 242 [2019-10-02 14:29:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:23,124 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2019-10-02 14:29:23,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-02 14:29:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2019-10-02 14:29:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 14:29:23,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:23,127 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 30, 30, 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:29:23,128 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:23,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:23,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1929689935, now seen corresponding path program 37 times [2019-10-02 14:29:23,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:23,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:23,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-10-02 14:29:23,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:23,973 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:24,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:24,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 14:29:24,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-10-02 14:29:24,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:24,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-02 14:29:24,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:29:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:29:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:29:24,198 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand 41 states. [2019-10-02 14:29:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:24,299 INFO L93 Difference]: Finished difference Result 236 states and 264 transitions. [2019-10-02 14:29:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:29:24,300 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 246 [2019-10-02 14:29:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:24,301 INFO L225 Difference]: With dead ends: 236 [2019-10-02 14:29:24,301 INFO L226 Difference]: Without dead ends: 160 [2019-10-02 14:29:24,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:29:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-02 14:29:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-10-02 14:29:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-02 14:29:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2019-10-02 14:29:24,307 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 246 [2019-10-02 14:29:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:24,307 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2019-10-02 14:29:24,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:29:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2019-10-02 14:29:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 14:29:24,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:24,309 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 30, 30, 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:29:24,310 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:24,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1228131567, now seen corresponding path program 38 times [2019-10-02 14:29:24,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:24,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3389 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-10-02 14:29:25,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:25,124 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:25,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:29:25,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:29:25,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 14:29:25,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3389 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-10-02 14:29:25,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:25,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-02 14:29:25,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:29:25,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:29:25,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:29:25,360 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 42 states. [2019-10-02 14:29:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:25,477 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2019-10-02 14:29:25,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:29:25,478 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 248 [2019-10-02 14:29:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:25,479 INFO L225 Difference]: With dead ends: 238 [2019-10-02 14:29:25,479 INFO L226 Difference]: Without dead ends: 162 [2019-10-02 14:29:25,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:29:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-02 14:29:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-10-02 14:29:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-02 14:29:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2019-10-02 14:29:25,485 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 248 [2019-10-02 14:29:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:25,485 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2019-10-02 14:29:25,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:29:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2019-10-02 14:29:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-02 14:29:25,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:25,487 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 30, 30, 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:29:25,487 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:25,487 INFO L82 PathProgramCache]: Analyzing trace with hash 647283283, now seen corresponding path program 39 times [2019-10-02 14:29:25,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:25,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:25,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3466 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-10-02 14:29:26,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:26,291 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:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:29:26,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-02 14:29:26,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:26,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:29:26,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3466 backedges. 848 proven. 190 refuted. 0 times theorem prover too weak. 2428 trivial. 0 not checked. [2019-10-02 14:29:27,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 13] total 53 [2019-10-02 14:29:27,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 14:29:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 14:29:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=938, Invalid=1818, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:29:27,207 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 53 states. [2019-10-02 14:29:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:27,470 INFO L93 Difference]: Finished difference Result 246 states and 280 transitions. [2019-10-02 14:29:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 14:29:27,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 250 [2019-10-02 14:29:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:27,471 INFO L225 Difference]: With dead ends: 246 [2019-10-02 14:29:27,471 INFO L226 Difference]: Without dead ends: 170 [2019-10-02 14:29:27,472 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=938, Invalid=1818, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:29:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-02 14:29:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-10-02 14:29:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-02 14:29:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2019-10-02 14:29:27,477 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 250 [2019-10-02 14:29:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:27,478 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2019-10-02 14:29:27,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 14:29:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2019-10-02 14:29:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 14:29:27,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:27,480 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 33, 33, 33, 33, 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:29:27,480 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash -312617040, now seen corresponding path program 40 times [2019-10-02 14:29:27,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:27,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 1020 proven. 231 refuted. 0 times theorem prover too weak. 2675 trivial. 0 not checked. [2019-10-02 14:29:27,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:27,702 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:27,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:29:27,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:29:27,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:27,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 14:29:27,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 1020 proven. 231 refuted. 0 times theorem prover too weak. 2675 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:29:27,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:29:27,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-02 14:29:27,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:29:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:29:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:29:27,968 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand 15 states. [2019-10-02 14:29:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:28,019 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2019-10-02 14:29:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:29:28,020 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 264 [2019-10-02 14:29:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:28,022 INFO L225 Difference]: With dead ends: 253 [2019-10-02 14:29:28,022 INFO L226 Difference]: Without dead ends: 174 [2019-10-02 14:29:28,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:29:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-02 14:29:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-10-02 14:29:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-02 14:29:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2019-10-02 14:29:28,032 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 264 [2019-10-02 14:29:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:28,032 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2019-10-02 14:29:28,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:29:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2019-10-02 14:29:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 14:29:28,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:28,034 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 36, 36, 36, 36, 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:29:28,034 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -671836725, now seen corresponding path program 41 times [2019-10-02 14:29:28,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:28,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:28,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4343 backedges. 604 proven. 880 refuted. 0 times theorem prover too weak. 2859 trivial. 0 not checked. [2019-10-02 14:29:28,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:28,305 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:28,377 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:30:20,462 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-10-02 14:30:20,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:30:20,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 14:30:20,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:30:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4343 backedges. 1204 proven. 276 refuted. 0 times theorem prover too weak. 2863 trivial. 0 not checked. [2019-10-02 14:30:20,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:30:20,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-02 14:30:20,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 14:30:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 14:30:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:30:20,544 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 16 states. [2019-10-02 14:30:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:30:20,616 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2019-10-02 14:30:20,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:30:20,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 276 [2019-10-02 14:30:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:30:20,618 INFO L225 Difference]: With dead ends: 261 [2019-10-02 14:30:20,618 INFO L226 Difference]: Without dead ends: 178 [2019-10-02 14:30:20,619 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:30:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-02 14:30:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2019-10-02 14:30:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-02 14:30:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 192 transitions. [2019-10-02 14:30:20,624 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 192 transitions. Word has length 276 [2019-10-02 14:30:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:30:20,624 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 192 transitions. [2019-10-02 14:30:20,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 14:30:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2019-10-02 14:30:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 14:30:20,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:30:20,627 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 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:30:20,627 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:30:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:30:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash -4553882, now seen corresponding path program 42 times [2019-10-02 14:30:20,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:30:20,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:30:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:20,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:30:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:30:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4796 backedges. 706 proven. 1031 refuted. 0 times theorem prover too weak. 3059 trivial. 0 not checked. [2019-10-02 14:30:20,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:30: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 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:30:21,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:30:27,037 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-02 14:30:27,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:30:27,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:30:27,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:30:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4796 backedges. 1414 proven. 100 refuted. 0 times theorem prover too weak. 3282 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:30:27,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:30:27,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2019-10-02 14:30:27,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:30:27,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:30:27,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:30:27,307 INFO L87 Difference]: Start difference. First operand 175 states and 192 transitions. Second operand 27 states. [2019-10-02 14:30:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:30:27,423 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2019-10-02 14:30:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:30:27,425 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 288 [2019-10-02 14:30:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:30:27,427 INFO L225 Difference]: With dead ends: 272 [2019-10-02 14:30:27,427 INFO L226 Difference]: Without dead ends: 185 [2019-10-02 14:30:27,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:30:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-02 14:30:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2019-10-02 14:30:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-02 14:30:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 199 transitions. [2019-10-02 14:30:27,433 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 199 transitions. Word has length 288 [2019-10-02 14:30:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:30:27,433 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 199 transitions. [2019-10-02 14:30:27,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:30:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2019-10-02 14:30:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 14:30:27,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:30:27,436 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 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:30:27,436 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:30:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:30:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash 740380639, now seen corresponding path program 43 times [2019-10-02 14:30:27,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:30:27,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:30:27,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:27,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:30:27,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:30:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5306 backedges. 1632 proven. 378 refuted. 0 times theorem prover too weak. 3296 trivial. 0 not checked. [2019-10-02 14:30:27,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:30:27,784 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:30:27,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:30:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:30:28,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:30:28,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:30:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5306 backedges. 1628 proven. 378 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2019-10-02 14:30:28,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:30:28,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 14:30:28,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:30:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:30:28,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:30:28,077 INFO L87 Difference]: Start difference. First operand 181 states and 199 transitions. Second operand 18 states. [2019-10-02 14:30:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:30:28,146 INFO L93 Difference]: Finished difference Result 281 states and 321 transitions. [2019-10-02 14:30:28,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:30:28,147 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 302 [2019-10-02 14:30:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:30:28,148 INFO L225 Difference]: With dead ends: 281 [2019-10-02 14:30:28,148 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 14:30:28,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 302 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:30:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 14:30:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2019-10-02 14:30:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-02 14:30:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2019-10-02 14:30:28,153 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 302 [2019-10-02 14:30:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:30:28,154 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2019-10-02 14:30:28,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:30:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2019-10-02 14:30:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 14:30:28,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:30:28,156 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 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:30:28,156 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:30:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:30:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1349281146, now seen corresponding path program 44 times [2019-10-02 14:30:28,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:30:28,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:30:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:28,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:30:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:30:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5831 backedges. 1868 proven. 435 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2019-10-02 14:30:28,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:30:28,517 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:30:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:30:28,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:30:28,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:30:28,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:30:28,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:30:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5831 backedges. 1864 proven. 435 refuted. 0 times theorem prover too weak. 3532 trivial. 0 not checked. [2019-10-02 14:30:28,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:30:28,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-02 14:30:28,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:30:28,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:30:28,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:30:28,843 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 19 states. [2019-10-02 14:30:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:30:28,940 INFO L93 Difference]: Finished difference Result 289 states and 331 transitions. [2019-10-02 14:30:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:30:28,941 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 314 [2019-10-02 14:30:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:30:28,942 INFO L225 Difference]: With dead ends: 289 [2019-10-02 14:30:28,942 INFO L226 Difference]: Without dead ends: 192 [2019-10-02 14:30:28,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:30:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-02 14:30:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-10-02 14:30:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-02 14:30:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2019-10-02 14:30:28,949 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 314 [2019-10-02 14:30:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:30:28,949 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2019-10-02 14:30:28,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:30:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2019-10-02 14:30:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 14:30:28,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:30:28,952 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 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:30:28,952 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:30:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:30:28,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1853893269, now seen corresponding path program 45 times [2019-10-02 14:30:28,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:30:28,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:30:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:28,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:30:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:30:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6392 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 6271 trivial. 0 not checked. [2019-10-02 14:30:29,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:30:29,304 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:30:29,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:30:30,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-02 14:30:30,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:30:30,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 14:30:30,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:30:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6392 backedges. 2122 proven. 121 refuted. 0 times theorem prover too weak. 4149 trivial. 0 not checked. [2019-10-02 14:30:30,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:30:30,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-02 14:30:30,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:30:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:30:30,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:30:30,615 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand 15 states. [2019-10-02 14:30:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:30:30,661 INFO L93 Difference]: Finished difference Result 267 states and 304 transitions. [2019-10-02 14:30:30,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:30:30,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 326 [2019-10-02 14:30:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:30:30,663 INFO L225 Difference]: With dead ends: 267 [2019-10-02 14:30:30,663 INFO L226 Difference]: Without dead ends: 192 [2019-10-02 14:30:30,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:30:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-02 14:30:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-10-02 14:30:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-02 14:30:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2019-10-02 14:30:30,669 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 326 [2019-10-02 14:30:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:30:30,670 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2019-10-02 14:30:30,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:30:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2019-10-02 14:30:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 14:30:30,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:30:30,672 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 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:30:30,673 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:30:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:30:30,673 INFO L82 PathProgramCache]: Analyzing trace with hash -303002509, now seen corresponding path program 46 times [2019-10-02 14:30:30,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:30:30,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:30:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:30,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:30:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:30:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6415 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 6271 trivial. 0 not checked. [2019-10-02 14:30:31,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:30:31,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 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:30:31,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:30:31,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:30:31,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:30:31,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:30:31,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:30:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6415 backedges. 2116 proven. 496 refuted. 0 times theorem prover too weak. 3803 trivial. 0 not checked. [2019-10-02 14:30:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:30:31,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2019-10-02 14:30:31,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:30:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:30:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:30:31,708 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 32 states. [2019-10-02 14:30:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:30:31,849 INFO L93 Difference]: Finished difference Result 304 states and 349 transitions. [2019-10-02 14:30:31,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:30:31,849 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 328 [2019-10-02 14:30:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:30:31,851 INFO L225 Difference]: With dead ends: 304 [2019-10-02 14:30:31,851 INFO L226 Difference]: Without dead ends: 201 [2019-10-02 14:30:31,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:30:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-02 14:30:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2019-10-02 14:30:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-02 14:30:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2019-10-02 14:30:31,859 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 328 [2019-10-02 14:30:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:30:31,859 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2019-10-02 14:30:31,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:30:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2019-10-02 14:30:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 14:30:31,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:30:31,862 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 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:30:31,862 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:30:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:30:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash 123303276, now seen corresponding path program 47 times [2019-10-02 14:30:31,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:30:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:30:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:31,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:30:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:30:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:30:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7037 backedges. 2388 proven. 561 refuted. 0 times theorem prover too weak. 4088 trivial. 0 not checked. [2019-10-02 14:30:32,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:30:32,263 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:30:32,329 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:32:06,295 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-10-02 14:32:06,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:06,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:32:06,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7037 backedges. 2384 proven. 561 refuted. 0 times theorem prover too weak. 4092 trivial. 0 not checked. [2019-10-02 14:32:06,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:06,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-02 14:32:06,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:32:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:32:06,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:32:06,442 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 21 states. [2019-10-02 14:32:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:06,551 INFO L93 Difference]: Finished difference Result 313 states and 359 transitions. [2019-10-02 14:32:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:32:06,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 342 [2019-10-02 14:32:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:06,553 INFO L225 Difference]: With dead ends: 313 [2019-10-02 14:32:06,554 INFO L226 Difference]: Without dead ends: 204 [2019-10-02 14:32:06,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 342 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:32:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-02 14:32:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-10-02 14:32:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-02 14:32:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2019-10-02 14:32:06,561 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 342 [2019-10-02 14:32:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:06,561 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2019-10-02 14:32:06,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:32:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2019-10-02 14:32:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-10-02 14:32:06,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:06,564 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 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:06,565 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:06,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:06,566 INFO L82 PathProgramCache]: Analyzing trace with hash -695227513, now seen corresponding path program 48 times [2019-10-02 14:32:06,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:06,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:06,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7670 backedges. 1336 proven. 1966 refuted. 0 times theorem prover too weak. 4368 trivial. 0 not checked. [2019-10-02 14:32:06,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:06,983 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:07,066 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:32:19,326 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-02 14:32:19,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:19,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:32:19,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7670 backedges. 2674 proven. 169 refuted. 0 times theorem prover too weak. 4827 trivial. 0 not checked. [2019-10-02 14:32:19,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:19,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 35 [2019-10-02 14:32:19,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 14:32:19,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 14:32:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:32:19,583 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand 35 states. [2019-10-02 14:32:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:19,763 INFO L93 Difference]: Finished difference Result 324 states and 373 transitions. [2019-10-02 14:32:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:32:19,763 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 354 [2019-10-02 14:32:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:19,765 INFO L225 Difference]: With dead ends: 324 [2019-10-02 14:32:19,766 INFO L226 Difference]: Without dead ends: 211 [2019-10-02 14:32:19,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:32:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-02 14:32:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-10-02 14:32:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-02 14:32:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2019-10-02 14:32:19,773 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 354 [2019-10-02 14:32:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:19,773 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2019-10-02 14:32:19,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 14:32:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2019-10-02 14:32:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-10-02 14:32:19,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:19,776 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 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:19,776 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash 118828800, now seen corresponding path program 49 times [2019-10-02 14:32:19,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:19,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:19,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8366 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 8170 trivial. 0 not checked. [2019-10-02 14:32:20,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:20,143 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:20,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:32:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:20,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:32:20,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8366 backedges. 2968 proven. 703 refuted. 0 times theorem prover too weak. 4695 trivial. 0 not checked. [2019-10-02 14:32:20,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:20,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2019-10-02 14:32:20,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 14:32:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 14:32:20,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:32:20,819 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand 37 states. [2019-10-02 14:32:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:21,012 INFO L93 Difference]: Finished difference Result 336 states and 387 transitions. [2019-10-02 14:32:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 14:32:21,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 368 [2019-10-02 14:32:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:21,015 INFO L225 Difference]: With dead ends: 336 [2019-10-02 14:32:21,015 INFO L226 Difference]: Without dead ends: 217 [2019-10-02 14:32:21,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:32:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-02 14:32:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2019-10-02 14:32:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-02 14:32:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 237 transitions. [2019-10-02 14:32:21,021 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 237 transitions. Word has length 368 [2019-10-02 14:32:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:21,022 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 237 transitions. [2019-10-02 14:32:21,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 14:32:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 237 transitions. [2019-10-02 14:32:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-02 14:32:21,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:21,025 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 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:21,025 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash -613895047, now seen corresponding path program 50 times [2019-10-02 14:32:21,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:32:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9100 backedges. 1644 proven. 2424 refuted. 0 times theorem prover too weak. 5032 trivial. 0 not checked. [2019-10-02 14:32:21,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:21,523 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:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:32:21,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:32:21,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:21,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:32:21,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9100 backedges. 3284 proven. 780 refuted. 0 times theorem prover too weak. 5036 trivial. 0 not checked. [2019-10-02 14:32:21,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:21,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 14:32:21,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:32:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:32:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:32:21,885 INFO L87 Difference]: Start difference. First operand 213 states and 237 transitions. Second operand 24 states. [2019-10-02 14:32:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:21,984 INFO L93 Difference]: Finished difference Result 345 states and 397 transitions. [2019-10-02 14:32:21,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:32:21,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 382 [2019-10-02 14:32:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:21,987 INFO L225 Difference]: With dead ends: 345 [2019-10-02 14:32:21,987 INFO L226 Difference]: Without dead ends: 220 [2019-10-02 14:32:21,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 382 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:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-02 14:32:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-10-02 14:32:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-02 14:32:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 242 transitions. [2019-10-02 14:32:21,993 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 242 transitions. Word has length 382 [2019-10-02 14:32:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:21,993 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 242 transitions. [2019-10-02 14:32:21,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:32:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 242 transitions. [2019-10-02 14:32:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-10-02 14:32:21,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:21,996 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 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:21,997 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 141150996, now seen corresponding path program 51 times [2019-10-02 14:32:21,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:21,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:21,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:21,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9841 backedges. 3620 proven. 861 refuted. 0 times theorem prover too weak. 5360 trivial. 0 not checked. [2019-10-02 14:32:22,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:22,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 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:22,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:32:27,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-02 14:32:27,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:27,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:32:27,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9841 backedges. 3622 proven. 225 refuted. 0 times theorem prover too weak. 5994 trivial. 0 not checked. [2019-10-02 14:32:27,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:27,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 40 [2019-10-02 14:32:27,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 14:32:27,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 14:32:27,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=1132, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:32:27,568 INFO L87 Difference]: Start difference. First operand 217 states and 242 transitions. Second operand 40 states. [2019-10-02 14:32:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:27,791 INFO L93 Difference]: Finished difference Result 356 states and 411 transitions. [2019-10-02 14:32:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:32:27,792 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 394 [2019-10-02 14:32:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:27,793 INFO L225 Difference]: With dead ends: 356 [2019-10-02 14:32:27,794 INFO L226 Difference]: Without dead ends: 227 [2019-10-02 14:32:27,794 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=428, Invalid=1132, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:32:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-02 14:32:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-10-02 14:32:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-02 14:32:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2019-10-02 14:32:27,800 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 394 [2019-10-02 14:32:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:27,801 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2019-10-02 14:32:27,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 14:32:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2019-10-02 14:32:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-10-02 14:32:27,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:27,804 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 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:32:27,804 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:27,804 INFO L82 PathProgramCache]: Analyzing trace with hash 275327757, now seen corresponding path program 52 times [2019-10-02 14:32:27,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:27,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:27,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:27,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:27,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10649 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10393 trivial. 0 not checked. [2019-10-02 14:32:28,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:28,270 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:28,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:32:28,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:32:28,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:32:28,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:32:28,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:32:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10649 backedges. 3964 proven. 946 refuted. 0 times theorem prover too weak. 5739 trivial. 0 not checked. [2019-10-02 14:32:28,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:32:28,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 42 [2019-10-02 14:32:28,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 14:32:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 14:32:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1252, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:32:28,982 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 42 states. [2019-10-02 14:32:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:32:29,175 INFO L93 Difference]: Finished difference Result 368 states and 425 transitions. [2019-10-02 14:32:29,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 14:32:29,175 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 408 [2019-10-02 14:32:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:32:29,177 INFO L225 Difference]: With dead ends: 368 [2019-10-02 14:32:29,177 INFO L226 Difference]: Without dead ends: 233 [2019-10-02 14:32:29,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=470, Invalid=1252, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:32:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-02 14:32:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2019-10-02 14:32:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-02 14:32:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 256 transitions. [2019-10-02 14:32:29,184 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 256 transitions. Word has length 408 [2019-10-02 14:32:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:32:29,185 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 256 transitions. [2019-10-02 14:32:29,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 14:32:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 256 transitions. [2019-10-02 14:32:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-02 14:32:29,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:32:29,188 INFO L411 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 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:32:29,188 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:32:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:32:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash -359674618, now seen corresponding path program 53 times [2019-10-02 14:32:29,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:32:29,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:32:29,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:29,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:32:29,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:32:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:32:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11495 backedges. 4332 proven. 1035 refuted. 0 times theorem prover too weak. 6128 trivial. 0 not checked. [2019-10-02 14:32:29,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:32:29,725 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:29,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:34:46,931 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-02 14:34:46,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:34:46,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:34:46,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:34:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 11495 backedges. 4328 proven. 1035 refuted. 0 times theorem prover too weak. 6132 trivial. 0 not checked. [2019-10-02 14:34:47,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:34:47,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-02 14:34:47,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:34:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:34:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:34:47,094 INFO L87 Difference]: Start difference. First operand 229 states and 256 transitions. Second operand 27 states. [2019-10-02 14:34:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:34:47,196 INFO L93 Difference]: Finished difference Result 377 states and 435 transitions. [2019-10-02 14:34:47,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:34:47,200 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 422 [2019-10-02 14:34:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:34:47,201 INFO L225 Difference]: With dead ends: 377 [2019-10-02 14:34:47,201 INFO L226 Difference]: Without dead ends: 236 [2019-10-02 14:34:47,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 422 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:34:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-02 14:34:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2019-10-02 14:34:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-02 14:34:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 261 transitions. [2019-10-02 14:34:47,207 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 261 transitions. Word has length 422 [2019-10-02 14:34:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:34:47,207 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 261 transitions. [2019-10-02 14:34:47,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:34:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 261 transitions. [2019-10-02 14:34:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-10-02 14:34:47,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:34:47,210 INFO L411 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 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:47,211 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:34:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:34:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -149191647, now seen corresponding path program 54 times [2019-10-02 14:34:47,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:34:47,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:34:47,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:47,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:34:47,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:34:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:34:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12344 backedges. 4712 proven. 1128 refuted. 0 times theorem prover too weak. 6504 trivial. 0 not checked. [2019-10-02 14:34:47,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:34:47,785 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:47,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:35:17,710 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2019-10-02 14:35:17,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:35:17,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-02 14:35:17,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:35:17,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:35:17,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:17,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-02 14:35:17,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:35:17,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:17,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-10-02 14:35:17,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:35:17,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:17,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-10-02 14:35:17,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:35:17,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:17,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-10-02 14:35:17,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:35:17,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:17,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:35:17,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-10-02 14:35:18,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:35:18,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:18,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2019-10-02 14:35:18,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:35:18,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:18,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:35:18,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:19 [2019-10-02 14:35:18,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:35:18,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:35:18,531 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:18,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 32 [2019-10-02 14:35:18,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:35:18,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:35:18,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:35:18,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:35:18,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:1 [2019-10-02 14:35:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12344 backedges. 6795 proven. 552 refuted. 0 times theorem prover too weak. 4997 trivial. 0 not checked. [2019-10-02 14:35:19,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:35:19,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2019-10-02 14:35:19,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 14:35:19,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 14:35:19,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=1204, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:35:19,348 INFO L87 Difference]: Start difference. First operand 233 states and 261 transitions. Second operand 43 states. [2019-10-02 14:35:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:35:22,787 INFO L93 Difference]: Finished difference Result 715 states and 859 transitions. [2019-10-02 14:35:22,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-10-02 14:35:22,788 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 434 [2019-10-02 14:35:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:35:22,792 INFO L225 Difference]: With dead ends: 715 [2019-10-02 14:35:22,792 INFO L226 Difference]: Without dead ends: 469 [2019-10-02 14:35:22,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4452 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3536, Invalid=10506, Unknown=0, NotChecked=0, Total=14042 [2019-10-02 14:35:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-10-02 14:35:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 450. [2019-10-02 14:35:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-02 14:35:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 532 transitions. [2019-10-02 14:35:22,820 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 532 transitions. Word has length 434 [2019-10-02 14:35:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:35:22,820 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 532 transitions. [2019-10-02 14:35:22,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 14:35:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 532 transitions. [2019-10-02 14:35:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-02 14:35:22,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:35:22,827 INFO L411 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 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, 1] [2019-10-02 14:35:22,827 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:35:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:35:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash 149249470, now seen corresponding path program 1 times [2019-10-02 14:35:22,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:35:22,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:35:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:22,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:35:22,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:35:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13229 backedges. 2554 proven. 3779 refuted. 0 times theorem prover too weak. 6896 trivial. 0 not checked. [2019-10-02 14:35:23,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:35:23,602 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:35:23,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:35:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:35:23,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:35:23,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:35:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13229 backedges. 5104 proven. 1225 refuted. 0 times theorem prover too weak. 6900 trivial. 0 not checked. [2019-10-02 14:35:24,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:35:24,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 14:35:24,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:35:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:35:24,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:35:24,018 INFO L87 Difference]: Start difference. First operand 450 states and 532 transitions. Second operand 29 states. [2019-10-02 14:35:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:35:24,157 INFO L93 Difference]: Finished difference Result 833 states and 1010 transitions. [2019-10-02 14:35:24,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:35:24,160 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 446 [2019-10-02 14:35:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:35:24,165 INFO L225 Difference]: With dead ends: 833 [2019-10-02 14:35:24,165 INFO L226 Difference]: Without dead ends: 471 [2019-10-02 14:35:24,166 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 446 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:35:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-02 14:35:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 462. [2019-10-02 14:35:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-10-02 14:35:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 547 transitions. [2019-10-02 14:35:24,180 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 547 transitions. Word has length 446 [2019-10-02 14:35:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:35:24,180 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 547 transitions. [2019-10-02 14:35:24,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:35:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 547 transitions. [2019-10-02 14:35:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2019-10-02 14:35:24,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:35:24,184 INFO L411 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 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, 1] [2019-10-02 14:35:24,185 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:35:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:35:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2132709849, now seen corresponding path program 2 times [2019-10-02 14:35:24,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:35:24,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:35:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:24,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:35:24,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:35:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 5520 proven. 1326 refuted. 0 times theorem prover too weak. 7304 trivial. 0 not checked. [2019-10-02 14:35:24,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:35:24,927 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:35:25,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:35:25,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:35:25,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:35:25,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:35:25,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:35:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 14150 backedges. 5516 proven. 1326 refuted. 0 times theorem prover too weak. 7308 trivial. 0 not checked. [2019-10-02 14:35:25,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:35:25,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 14:35:25,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:35:25,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:35:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:35:25,358 INFO L87 Difference]: Start difference. First operand 462 states and 547 transitions. Second operand 30 states. [2019-10-02 14:35:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:35:25,491 INFO L93 Difference]: Finished difference Result 857 states and 1040 transitions. [2019-10-02 14:35:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 14:35:25,491 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 458 [2019-10-02 14:35:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:35:25,494 INFO L225 Difference]: With dead ends: 857 [2019-10-02 14:35:25,494 INFO L226 Difference]: Without dead ends: 483 [2019-10-02 14:35:25,495 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 458 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:35:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-02 14:35:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 474. [2019-10-02 14:35:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-02 14:35:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 562 transitions. [2019-10-02 14:35:25,508 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 562 transitions. Word has length 458 [2019-10-02 14:35:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:35:25,509 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 562 transitions. [2019-10-02 14:35:25,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:35:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 562 transitions. [2019-10-02 14:35:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-10-02 14:35:25,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:35:25,513 INFO L411 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 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, 1] [2019-10-02 14:35:25,513 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:35:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:35:25,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1791833460, now seen corresponding path program 3 times [2019-10-02 14:35:25,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:35:25,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:35:25,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:25,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:35:25,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:35:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15107 backedges. 2974 proven. 4405 refuted. 0 times theorem prover too weak. 7728 trivial. 0 not checked. [2019-10-02 14:35:26,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:35:26,279 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:35:26,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:35:30,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-02 14:35:30,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:35:30,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:35:30,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:35:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15107 backedges. 6029 proven. 289 refuted. 0 times theorem prover too weak. 8789 trivial. 0 not checked. [2019-10-02 14:35:31,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:35:31,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22] total 50 [2019-10-02 14:35:31,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 14:35:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 14:35:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=1821, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:35:31,241 INFO L87 Difference]: Start difference. First operand 474 states and 562 transitions. Second operand 50 states. [2019-10-02 14:35:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:35:32,003 INFO L93 Difference]: Finished difference Result 884 states and 1074 transitions. [2019-10-02 14:35:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 14:35:32,003 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 470 [2019-10-02 14:35:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:35:32,005 INFO L225 Difference]: With dead ends: 884 [2019-10-02 14:35:32,005 INFO L226 Difference]: Without dead ends: 498 [2019-10-02 14:35:32,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1007, Invalid=3549, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 14:35:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-02 14:35:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-10-02 14:35:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-02 14:35:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 579 transitions. [2019-10-02 14:35:32,021 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 579 transitions. Word has length 470 [2019-10-02 14:35:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:35:32,021 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 579 transitions. [2019-10-02 14:35:32,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 14:35:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 579 transitions. [2019-10-02 14:35:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-10-02 14:35:32,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:35:32,026 INFO L411 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 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, 1] [2019-10-02 14:35:32,026 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:35:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:35:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1885356269, now seen corresponding path program 4 times [2019-10-02 14:35:32,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:35:32,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:35:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:32,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:35:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:35:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16135 backedges. 3196 proven. 4736 refuted. 0 times theorem prover too weak. 8203 trivial. 0 not checked. [2019-10-02 14:35:33,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:35:33,070 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:35:33,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:35:33,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:35:33,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:35:33,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 14:35:33,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:35:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16135 backedges. 6388 proven. 1540 refuted. 0 times theorem prover too weak. 8207 trivial. 0 not checked. [2019-10-02 14:35:33,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:35:33,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-02 14:35:33,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:35:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:35:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:35:33,707 INFO L87 Difference]: Start difference. First operand 488 states and 579 transitions. Second operand 32 states. [2019-10-02 14:35:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:35:33,884 INFO L93 Difference]: Finished difference Result 909 states and 1104 transitions. [2019-10-02 14:35:33,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:35:33,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 484 [2019-10-02 14:35:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:35:33,889 INFO L225 Difference]: With dead ends: 909 [2019-10-02 14:35:33,889 INFO L226 Difference]: Without dead ends: 509 [2019-10-02 14:35:33,890 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:35:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-02 14:35:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 500. [2019-10-02 14:35:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-02 14:35:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 594 transitions. [2019-10-02 14:35:33,916 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 594 transitions. Word has length 484 [2019-10-02 14:35:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:35:33,919 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 594 transitions. [2019-10-02 14:35:33,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:35:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 594 transitions. [2019-10-02 14:35:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-10-02 14:35:33,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:35:33,925 INFO L411 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 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, 1] [2019-10-02 14:35:33,925 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:35:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:35:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1959578760, now seen corresponding path program 5 times [2019-10-02 14:35:33,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:35:33,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:35:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:33,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:35:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:35:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:35:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17164 backedges. 3426 proven. 5079 refuted. 0 times theorem prover too weak. 8659 trivial. 0 not checked. [2019-10-02 14:35:34,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:35:34,991 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:35:35,076 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:37:55,584 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-10-02 14:37:55,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:37:55,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 14:37:55,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:37:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17164 backedges. 6848 proven. 1653 refuted. 0 times theorem prover too weak. 8663 trivial. 0 not checked. [2019-10-02 14:37:55,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:37:55,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-02 14:37:55,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:37:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:37:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:37:55,832 INFO L87 Difference]: Start difference. First operand 500 states and 594 transitions. Second operand 33 states. [2019-10-02 14:37:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:37:56,001 INFO L93 Difference]: Finished difference Result 933 states and 1134 transitions. [2019-10-02 14:37:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:37:56,004 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 496 [2019-10-02 14:37:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:37:56,007 INFO L225 Difference]: With dead ends: 933 [2019-10-02 14:37:56,007 INFO L226 Difference]: Without dead ends: 521 [2019-10-02 14:37:56,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:37:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-10-02 14:37:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 512. [2019-10-02 14:37:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-02 14:37:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 609 transitions. [2019-10-02 14:37:56,023 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 609 transitions. Word has length 496 [2019-10-02 14:37:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:37:56,024 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 609 transitions. [2019-10-02 14:37:56,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:37:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 609 transitions. [2019-10-02 14:37:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-10-02 14:37:56,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:37:56,029 INFO L411 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 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, 1] [2019-10-02 14:37:56,029 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:37:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:37:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash 983058339, now seen corresponding path program 6 times [2019-10-02 14:37:56,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:37:56,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:37:56,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:37:56,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:37:56,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:37:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:37:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18229 backedges. 7328 proven. 1770 refuted. 0 times theorem prover too weak. 9131 trivial. 0 not checked. [2019-10-02 14:37:56,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:37:56,957 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:37:57,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:38:12,126 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-10-02 14:38:12,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:38:12,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:38:12,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:38:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18229 backedges. 7330 proven. 324 refuted. 0 times theorem prover too weak. 10575 trivial. 0 not checked. [2019-10-02 14:38:12,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:38:12,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21] total 52 [2019-10-02 14:38:12,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 14:38:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 14:38:12,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=1915, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:38:12,672 INFO L87 Difference]: Start difference. First operand 512 states and 609 transitions. Second operand 52 states. [2019-10-02 14:38:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:38:12,940 INFO L93 Difference]: Finished difference Result 960 states and 1168 transitions. [2019-10-02 14:38:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 14:38:12,941 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 508 [2019-10-02 14:38:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:38:12,943 INFO L225 Difference]: With dead ends: 960 [2019-10-02 14:38:12,943 INFO L226 Difference]: Without dead ends: 536 [2019-10-02 14:38:12,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=737, Invalid=1915, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:38:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-02 14:38:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 526. [2019-10-02 14:38:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-02 14:38:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 626 transitions. [2019-10-02 14:38:12,959 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 626 transitions. Word has length 508 [2019-10-02 14:38:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:38:12,959 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 626 transitions. [2019-10-02 14:38:12,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 14:38:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 626 transitions. [2019-10-02 14:38:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-10-02 14:38:12,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:38:12,964 INFO L411 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 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, 1] [2019-10-02 14:38:12,964 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:38:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:38:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1069259236, now seen corresponding path program 7 times [2019-10-02 14:38:12,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:38:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:38:12,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:12,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:38:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:38:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 19367 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 19006 trivial. 0 not checked. [2019-10-02 14:38:13,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:38:13,730 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:38:13,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:38:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:38:14,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:38:14,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:38:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19367 backedges. 7816 proven. 1891 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-10-02 14:38:14,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:38:14,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 34] total 54 [2019-10-02 14:38:14,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-02 14:38:14,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-02 14:38:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=2071, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 14:38:14,985 INFO L87 Difference]: Start difference. First operand 526 states and 626 transitions. Second operand 54 states. [2019-10-02 14:38:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:38:15,263 INFO L93 Difference]: Finished difference Result 988 states and 1202 transitions. [2019-10-02 14:38:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 14:38:15,264 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 522 [2019-10-02 14:38:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:38:15,267 INFO L225 Difference]: With dead ends: 988 [2019-10-02 14:38:15,267 INFO L226 Difference]: Without dead ends: 550 [2019-10-02 14:38:15,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=791, Invalid=2071, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 14:38:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-02 14:38:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 540. [2019-10-02 14:38:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-02 14:38:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 643 transitions. [2019-10-02 14:38:15,289 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 643 transitions. Word has length 522 [2019-10-02 14:38:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:38:15,289 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 643 transitions. [2019-10-02 14:38:15,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-02 14:38:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 643 transitions. [2019-10-02 14:38:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-10-02 14:38:15,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:38:15,294 INFO L411 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 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, 1] [2019-10-02 14:38:15,295 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:38:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:38:15,295 INFO L82 PathProgramCache]: Analyzing trace with hash -390347115, now seen corresponding path program 8 times [2019-10-02 14:38:15,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:38:15,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:38:15,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:15,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:38:15,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:38:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 20543 backedges. 4164 proven. 6180 refuted. 0 times theorem prover too weak. 10199 trivial. 0 not checked. [2019-10-02 14:38:16,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:38:16,122 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:38:16,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:38:16,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:38:16,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:38:16,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:38:16,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:38:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 20543 backedges. 8324 proven. 2016 refuted. 0 times theorem prover too weak. 10203 trivial. 0 not checked. [2019-10-02 14:38:16,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:38:16,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 14:38:16,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 14:38:16,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 14:38:16,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:38:16,612 INFO L87 Difference]: Start difference. First operand 540 states and 643 transitions. Second operand 36 states. [2019-10-02 14:38:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:38:16,788 INFO L93 Difference]: Finished difference Result 1013 states and 1232 transitions. [2019-10-02 14:38:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 14:38:16,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 536 [2019-10-02 14:38:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:38:16,791 INFO L225 Difference]: With dead ends: 1013 [2019-10-02 14:38:16,791 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 14:38:16,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 536 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:38:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 14:38:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 552. [2019-10-02 14:38:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-02 14:38:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 658 transitions. [2019-10-02 14:38:16,806 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 658 transitions. Word has length 536 [2019-10-02 14:38:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:38:16,807 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 658 transitions. [2019-10-02 14:38:16,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 14:38:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 658 transitions. [2019-10-02 14:38:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-10-02 14:38:16,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:38:16,813 INFO L411 BasicCegarLoop]: trace histogram [99, 99, 99, 98, 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, 1] [2019-10-02 14:38:16,813 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:38:16,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:38:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1098998320, now seen corresponding path program 9 times [2019-10-02 14:38:16,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:38:16,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:38:16,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:16,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:38:16,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:38:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21716 backedges. 8852 proven. 2145 refuted. 0 times theorem prover too weak. 10719 trivial. 0 not checked. [2019-10-02 14:38:17,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:38:17,824 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:38:17,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:38:32,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-02 14:38:32,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:38:32,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:38:32,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:38:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21716 backedges. 8854 proven. 400 refuted. 0 times theorem prover too weak. 12462 trivial. 0 not checked. [2019-10-02 14:38:33,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:38:33,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 23] total 57 [2019-10-02 14:38:33,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-02 14:38:33,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-02 14:38:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=2310, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 14:38:33,427 INFO L87 Difference]: Start difference. First operand 552 states and 658 transitions. Second operand 57 states. [2019-10-02 14:38:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:38:33,773 INFO L93 Difference]: Finished difference Result 1040 states and 1266 transitions. [2019-10-02 14:38:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 14:38:33,773 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 548 [2019-10-02 14:38:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:38:33,776 INFO L225 Difference]: With dead ends: 1040 [2019-10-02 14:38:33,776 INFO L226 Difference]: Without dead ends: 576 [2019-10-02 14:38:33,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=882, Invalid=2310, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 14:38:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-02 14:38:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 566. [2019-10-02 14:38:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-02 14:38:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 675 transitions. [2019-10-02 14:38:33,791 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 675 transitions. Word has length 548 [2019-10-02 14:38:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:38:33,791 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 675 transitions. [2019-10-02 14:38:33,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-02 14:38:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 675 transitions. [2019-10-02 14:38:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-10-02 14:38:33,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:38:33,796 INFO L411 BasicCegarLoop]: trace histogram [102, 102, 102, 101, 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, 1] [2019-10-02 14:38:33,796 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:38:33,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:38:33,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1441243863, now seen corresponding path program 10 times [2019-10-02 14:38:33,797 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:38:33,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:38:33,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:33,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:38:33,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:38:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22966 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 22525 trivial. 0 not checked. [2019-10-02 14:38:34,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:38:34,418 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:38:34,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:38:34,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:38:34,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:38:34,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 14:38:34,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:38:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 22966 backedges. 9388 proven. 2278 refuted. 0 times theorem prover too weak. 11300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (66)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:38:35,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:38:35,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 37] total 59 [2019-10-02 14:38:35,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 14:38:35,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 14:38:35,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=2481, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:38:35,905 INFO L87 Difference]: Start difference. First operand 566 states and 675 transitions. Second operand 59 states. [2019-10-02 14:38:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:38:36,222 INFO L93 Difference]: Finished difference Result 1068 states and 1300 transitions. [2019-10-02 14:38:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 14:38:36,223 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 562 [2019-10-02 14:38:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:38:36,225 INFO L225 Difference]: With dead ends: 1068 [2019-10-02 14:38:36,225 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 14:38:36,227 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=941, Invalid=2481, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:38:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 14:38:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 580. [2019-10-02 14:38:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-02 14:38:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 692 transitions. [2019-10-02 14:38:36,241 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 692 transitions. Word has length 562 [2019-10-02 14:38:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:38:36,241 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 692 transitions. [2019-10-02 14:38:36,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 14:38:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 692 transitions. [2019-10-02 14:38:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-10-02 14:38:36,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:38:36,247 INFO L411 BasicCegarLoop]: trace histogram [105, 105, 105, 104, 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, 1] [2019-10-02 14:38:36,247 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:38:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:38:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash 925096482, now seen corresponding path program 11 times [2019-10-02 14:38:36,247 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:38:36,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:38:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:36,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:38:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:38:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:38:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24254 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 23770 trivial. 0 not checked. [2019-10-02 14:38:36,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:38:36,965 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:38:37,060 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:41:34,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2019-10-02 14:41:34,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:34,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:41:34,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 24254 backedges. 9944 proven. 2415 refuted. 0 times theorem prover too weak. 11895 trivial. 0 not checked. [2019-10-02 14:41:35,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:35,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 38] total 61 [2019-10-02 14:41:35,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-02 14:41:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-02 14:41:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=2658, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 14:41:35,396 INFO L87 Difference]: Start difference. First operand 580 states and 692 transitions. Second operand 61 states. [2019-10-02 14:41:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:35,687 INFO L93 Difference]: Finished difference Result 1096 states and 1334 transitions. [2019-10-02 14:41:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 14:41:35,688 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 576 [2019-10-02 14:41:35,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:35,690 INFO L225 Difference]: With dead ends: 1096 [2019-10-02 14:41:35,691 INFO L226 Difference]: Without dead ends: 604 [2019-10-02 14:41:35,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1002, Invalid=2658, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 14:41:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-02 14:41:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 594. [2019-10-02 14:41:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-02 14:41:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 709 transitions. [2019-10-02 14:41:35,706 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 709 transitions. Word has length 576 [2019-10-02 14:41:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:35,706 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 709 transitions. [2019-10-02 14:41:35,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-02 14:41:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 709 transitions. [2019-10-02 14:41:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-10-02 14:41:35,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:35,712 INFO L411 BasicCegarLoop]: trace histogram [108, 108, 108, 107, 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, 1] [2019-10-02 14:41:35,712 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1351186715, now seen corresponding path program 12 times [2019-10-02 14:41:35,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:35,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:35,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:35,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:35,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25580 backedges. 10520 proven. 2556 refuted. 0 times theorem prover too weak. 12504 trivial. 0 not checked. [2019-10-02 14:41:36,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:36,673 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:41:36,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE