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/array-examples/standard_copy1_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:41:35,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:41:35,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:41:35,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:41:35,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:41:35,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:41:35,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:41:35,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:41:35,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:41:35,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:41:35,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:41:35,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:41:35,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:41:35,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:41:35,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:41:35,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:41:35,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:41:35,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:41:35,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:41:35,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:41:35,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:41:35,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:41:35,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:41:35,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:41:35,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:41:35,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:41:35,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:41:35,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:41:35,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:41:35,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:41:35,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:41:35,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:41:35,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:41:35,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:41:35,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:41:35,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:41:35,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:41:35,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:41:35,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:41:35,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:41:35,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:41:35,681 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-01 22:41:35,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:41:35,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:41:35,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:41:35,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:41:35,706 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:41:35,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:41:35,707 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:41:35,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:41:35,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:41:35,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:41:35,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:41:35,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:41:35,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:41:35,710 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:41:35,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:41:35,710 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:41:35,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:41:35,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:41:35,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:41:35,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:41:35,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:41:35,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:41:35,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:41:35,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:41:35,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:41:35,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:41:35,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:41:35,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:41:35,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:41:35,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:41:35,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:41:35,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:41:35,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:41:35,800 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:41:35,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-10-01 22:41:35,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe328ddc1/9b48facad072428e9cee7dc774b61c50/FLAG6d7f2a176 [2019-10-01 22:41:36,362 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:41:36,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-10-01 22:41:36,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe328ddc1/9b48facad072428e9cee7dc774b61c50/FLAG6d7f2a176 [2019-10-01 22:41:36,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe328ddc1/9b48facad072428e9cee7dc774b61c50 [2019-10-01 22:41:36,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:41:36,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:41:36,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:41:36,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:41:36,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:41:36,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:41:36" (1/1) ... [2019-10-01 22:41:36,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2be261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:36, skipping insertion in model container [2019-10-01 22:41:36,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:41:36" (1/1) ... [2019-10-01 22:41:36,818 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:41:36,836 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:41:37,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:41:37,041 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:41:37,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:41:37,086 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:41:37,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37 WrapperNode [2019-10-01 22:41:37,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:41:37,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:41:37,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:41:37,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:41:37,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (1/1) ... [2019-10-01 22:41:37,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (1/1) ... [2019-10-01 22:41:37,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (1/1) ... [2019-10-01 22:41:37,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (1/1) ... [2019-10-01 22:41:37,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (1/1) ... [2019-10-01 22:41:37,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (1/1) ... [2019-10-01 22:41:37,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (1/1) ... [2019-10-01 22:41:37,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:41:37,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:41:37,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:41:37,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:41:37,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (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-01 22:41:37,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:41:37,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:41:37,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:41:37,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:41:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:41:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:41:37,564 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:41:37,564 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:41:37,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:41:37 BoogieIcfgContainer [2019-10-01 22:41:37,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:41:37,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:41:37,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:41:37,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:41:37,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:41:36" (1/3) ... [2019-10-01 22:41:37,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b324f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:41:37, skipping insertion in model container [2019-10-01 22:41:37,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:41:37" (2/3) ... [2019-10-01 22:41:37,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b324f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:41:37, skipping insertion in model container [2019-10-01 22:41:37,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:41:37" (3/3) ... [2019-10-01 22:41:37,574 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy1_ground-2.i [2019-10-01 22:41:37,585 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:41:37,600 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:41:37,615 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:41:37,642 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:41:37,642 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:41:37,643 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:41:37,643 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:41:37,643 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:41:37,643 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:41:37,643 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:41:37,643 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:41:37,643 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:41:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-01 22:41:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:41:37,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:37,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:37,669 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-10-01 22:41:37,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:37,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:37,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:41:37,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:41:37,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:41:37,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:41:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:41:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:41:37,838 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-01 22:41:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:37,859 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-10-01 22:41:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:41:37,860 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 22:41:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:37,867 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:41:37,868 INFO L226 Difference]: Without dead ends: 22 [2019-10-01 22:41:37,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:41:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-01 22:41:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-01 22:41:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-01 22:41:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-01 22:41:37,907 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-01 22:41:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:37,907 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-01 22:41:37,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:41:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-01 22:41:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:41:37,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:37,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:37,909 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-10-01 22:41:37,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:37,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:41:37,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:41:37,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:41:37,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:41:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:41:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:41:37,977 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-10-01 22:41:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:38,038 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-10-01 22:41:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:41:38,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 22:41:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:38,040 INFO L225 Difference]: With dead ends: 38 [2019-10-01 22:41:38,040 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 22:41:38,041 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-01 22:41:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 22:41:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-01 22:41:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 22:41:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-01 22:41:38,047 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-10-01 22:41:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:38,048 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-01 22:41:38,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:41:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-01 22:41:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:41:38,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:38,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:38,049 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1578997828, now seen corresponding path program 1 times [2019-10-01 22:41:38,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:38,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:38,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:38,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:41:38,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:41:38,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:41:38,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:41:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:41:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:41:38,132 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-10-01 22:41:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:38,159 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-10-01 22:41:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:41:38,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-01 22:41:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:38,161 INFO L225 Difference]: With dead ends: 36 [2019-10-01 22:41:38,161 INFO L226 Difference]: Without dead ends: 25 [2019-10-01 22:41:38,162 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-01 22:41:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-01 22:41:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-01 22:41:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 22:41:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-01 22:41:38,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-01 22:41:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:38,173 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-01 22:41:38,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:41:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-01 22:41:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 22:41:38,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:38,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:38,176 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-10-01 22:41:38,177 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:38,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:41:38,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:38,250 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-01 22:41:38,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:38,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:41:38,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:41:38,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:38,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-01 22:41:38,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:41:38,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:41:38,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:41:38,370 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2019-10-01 22:41:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:38,438 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-01 22:41:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:41:38,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-01 22:41:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:38,440 INFO L225 Difference]: With dead ends: 45 [2019-10-01 22:41:38,441 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:41:38,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:41:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:41:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-10-01 22:41:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:41:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-01 22:41:38,455 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-10-01 22:41:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:38,455 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-01 22:41:38,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:41:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-01 22:41:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 22:41:38,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:38,460 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:38,460 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-10-01 22:41:38,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:38,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:38,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:41:38,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:38,572 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-01 22:41:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:41:38,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:41:38,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:38,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:41:38,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:41:38,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:38,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:41:38,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:41:38,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:41:38,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:41:38,661 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-10-01 22:41:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:38,701 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-01 22:41:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:41:38,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-01 22:41:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:38,703 INFO L225 Difference]: With dead ends: 48 [2019-10-01 22:41:38,703 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 22:41:38,704 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-01 22:41:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 22:41:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-01 22:41:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 22:41:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-01 22:41:38,711 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-10-01 22:41:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:38,712 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-01 22:41:38,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:41:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-01 22:41:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:41:38,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:38,715 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:38,715 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash 683083068, now seen corresponding path program 3 times [2019-10-01 22:41:38,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:38,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:41:38,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:38,853 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-01 22:41:38,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:38,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:41:38,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:38,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:41:38,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:41:38,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:38,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:41:38,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:41:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:41:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:41:38,955 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2019-10-01 22:41:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:38,998 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-10-01 22:41:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:41:39,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-01 22:41:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:39,001 INFO L225 Difference]: With dead ends: 44 [2019-10-01 22:41:39,002 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 22:41:39,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-01 22:41:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 22:41:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-01 22:41:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:41:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-01 22:41:39,008 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2019-10-01 22:41:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:39,009 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-01 22:41:39,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:41:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-01 22:41:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:41:39,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:39,010 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:39,010 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:39,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:39,011 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 4 times [2019-10-01 22:41:39,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:39,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:41:39,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:39,088 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:41:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:39,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:41:39,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:39,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:41:39,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:41:39,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:39,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-01 22:41:39,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:41:39,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:41:39,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:41:39,195 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2019-10-01 22:41:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:39,282 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-10-01 22:41:39,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:41:39,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-01 22:41:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:39,284 INFO L225 Difference]: With dead ends: 57 [2019-10-01 22:41:39,285 INFO L226 Difference]: Without dead ends: 38 [2019-10-01 22:41:39,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:41:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-01 22:41:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-01 22:41:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 22:41:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-01 22:41:39,297 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2019-10-01 22:41:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:39,298 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-01 22:41:39,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:41:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-01 22:41:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:41:39,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:39,299 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:39,299 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 702132246, now seen corresponding path program 5 times [2019-10-01 22:41:39,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:39,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:39,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:39,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:41:39,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:39,412 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:41:39,499 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-01 22:41:39,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:39,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:41:39,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:41:39,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:39,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:41:39,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:41:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:41:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:41:39,526 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2019-10-01 22:41:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:39,557 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-10-01 22:41:39,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:41:39,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-10-01 22:41:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:39,559 INFO L225 Difference]: With dead ends: 50 [2019-10-01 22:41:39,559 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:41:39,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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-01 22:41:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:41:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-10-01 22:41:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-01 22:41:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-10-01 22:41:39,565 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2019-10-01 22:41:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:39,566 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-10-01 22:41:39,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:41:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-10-01 22:41:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:41:39,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:39,567 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:39,568 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:39,568 INFO L82 PathProgramCache]: Analyzing trace with hash 469174772, now seen corresponding path program 6 times [2019-10-01 22:41:39,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:39,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:39,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:41:39,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:39,680 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) [2019-10-01 22:41:39,717 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:39,756 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-01 22:41:39,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:39,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:41:39,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:41:39,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:39,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:41:39,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:41:39,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:41:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:41:39,784 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2019-10-01 22:41:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:39,821 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-10-01 22:41:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:41:39,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-10-01 22:41:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:39,823 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:41:39,823 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 22:41:39,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:41:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 22:41:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-10-01 22:41:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 22:41:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-10-01 22:41:39,829 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2019-10-01 22:41:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:39,829 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-10-01 22:41:39,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:41:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-10-01 22:41:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 22:41:39,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:39,830 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:39,831 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash -64658350, now seen corresponding path program 7 times [2019-10-01 22:41:39,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:39,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:41:39,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:39,931 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-01 22:41:39,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:39,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:41:39,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:41:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-10-01 22:41:40,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:41:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:41:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:41:40,085 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 14 states. [2019-10-01 22:41:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:40,194 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-10-01 22:41:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:41:40,195 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-10-01 22:41:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:40,196 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:41:40,196 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:41:40,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:41:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:41:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-10-01 22:41:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:41:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-01 22:41:40,208 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 35 [2019-10-01 22:41:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:40,208 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-01 22:41:40,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:41:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-01 22:41:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:41:40,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:40,212 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:40,212 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -791930162, now seen corresponding path program 8 times [2019-10-01 22:41:40,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:40,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:40,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:40,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:40,324 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:41:40,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:41:40,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:40,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:41:40,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:40,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:40,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:41:40,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:41:40,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:41:40,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:41:40,412 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 9 states. [2019-10-01 22:41:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:40,448 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-10-01 22:41:40,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:41:40,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-10-01 22:41:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:40,450 INFO L225 Difference]: With dead ends: 74 [2019-10-01 22:41:40,450 INFO L226 Difference]: Without dead ends: 47 [2019-10-01 22:41:40,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:41:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-01 22:41:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-01 22:41:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 22:41:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-01 22:41:40,456 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2019-10-01 22:41:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:40,457 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-01 22:41:40,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:41:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-01 22:41:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 22:41:40,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:40,458 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:40,458 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash 67184364, now seen corresponding path program 9 times [2019-10-01 22:41:40,459 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:40,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:40,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:40,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:40,559 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) [2019-10-01 22:41:40,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:40,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:41:40,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:40,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:41:40,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:40,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:41:40,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:41:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:41:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:41:40,674 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 10 states. [2019-10-01 22:41:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:40,728 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-10-01 22:41:40,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:41:40,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-01 22:41:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:40,729 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:41:40,730 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:41:40,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:41:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:41:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-10-01 22:41:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 22:41:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-10-01 22:41:40,735 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2019-10-01 22:41:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:40,736 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-10-01 22:41:40,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:41:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-10-01 22:41:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 22:41:40,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:40,737 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:40,737 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1042523018, now seen corresponding path program 10 times [2019-10-01 22:41:40,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:40,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:40,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:40,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:40,822 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-01 22:41:40,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:41:40,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:41:40,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:40,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:41:40,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:40,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:40,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:41:40,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:41:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:41:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:41:40,903 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 11 states. [2019-10-01 22:41:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:40,961 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-10-01 22:41:40,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:41:40,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-10-01 22:41:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:40,963 INFO L225 Difference]: With dead ends: 78 [2019-10-01 22:41:40,963 INFO L226 Difference]: Without dead ends: 51 [2019-10-01 22:41:40,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 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-01 22:41:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-01 22:41:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-10-01 22:41:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 22:41:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-01 22:41:40,977 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2019-10-01 22:41:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:40,978 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-01 22:41:40,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:41:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-01 22:41:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 22:41:40,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:40,982 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:40,983 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2040098984, now seen corresponding path program 11 times [2019-10-01 22:41:40,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:40,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:40,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:40,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:41,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:41,106 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-01 22:41:41,136 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:41:41,337 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-01 22:41:41,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:41,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:41:41,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:41,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:41,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:41:41,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:41:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:41:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:41:41,392 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 12 states. [2019-10-01 22:41:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:41,444 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-10-01 22:41:41,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:41:41,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-10-01 22:41:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:41,446 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:41:41,446 INFO L226 Difference]: Without dead ends: 53 [2019-10-01 22:41:41,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 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-01 22:41:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-01 22:41:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-10-01 22:41:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:41:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-01 22:41:41,460 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2019-10-01 22:41:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:41,466 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-01 22:41:41,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:41:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-01 22:41:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:41:41,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:41,467 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:41,467 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1362071994, now seen corresponding path program 12 times [2019-10-01 22:41:41,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:41,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:41,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:41,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:41,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:41,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 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-01 22:41:41,622 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:41:41,794 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 22:41:41,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:41,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:41:41,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-01 22:41:41,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:41,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-10-01 22:41:41,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:41:41,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:41:41,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:41:41,950 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2019-10-01 22:41:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:42,043 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-10-01 22:41:42,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:41:42,043 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-10-01 22:41:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:42,044 INFO L225 Difference]: With dead ends: 85 [2019-10-01 22:41:42,044 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 22:41:42,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:41:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 22:41:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-10-01 22:41:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 22:41:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-01 22:41:42,050 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 47 [2019-10-01 22:41:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:42,051 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-01 22:41:42,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:41:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-01 22:41:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 22:41:42,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:42,052 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:42,052 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash -564528446, now seen corresponding path program 13 times [2019-10-01 22:41:42,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:42,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:42,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:41:42,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:42,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:42,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:42,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:41:42,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:41:42,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:42,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:41:42,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:41:42,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:41:42,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:41:42,294 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 14 states. [2019-10-01 22:41:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:42,340 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-10-01 22:41:42,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:41:42,340 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2019-10-01 22:41:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:42,341 INFO L225 Difference]: With dead ends: 88 [2019-10-01 22:41:42,341 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 22:41:42,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 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-01 22:41:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 22:41:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-10-01 22:41:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 22:41:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-01 22:41:42,346 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 51 [2019-10-01 22:41:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:42,346 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-01 22:41:42,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:41:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-01 22:41:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:41:42,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:42,348 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:42,348 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash 28821984, now seen corresponding path program 14 times [2019-10-01 22:41:42,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:42,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:42,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:42,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:42,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:41:42,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:42,534 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-01 22:41:42,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:41:42,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:41:42,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:42,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:41:42,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:41:42,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:42,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:41:42,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:41:42,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:41:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:41:42,667 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 15 states. [2019-10-01 22:41:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:42,728 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-10-01 22:41:42,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:41:42,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2019-10-01 22:41:42,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:42,729 INFO L225 Difference]: With dead ends: 90 [2019-10-01 22:41:42,730 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:41:42,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:41:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:41:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-01 22:41:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 22:41:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-01 22:41:42,744 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2019-10-01 22:41:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:42,744 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-01 22:41:42,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:41:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-01 22:41:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:41:42,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:42,745 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:42,746 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -992065154, now seen corresponding path program 15 times [2019-10-01 22:41:42,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:42,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:41:42,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:42,942 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:42,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:41:43,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:41:43,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:43,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:41:43,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:41:43,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:43,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-10-01 22:41:43,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:41:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:41:43,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:41:43,402 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 24 states. [2019-10-01 22:41:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:43,500 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-10-01 22:41:43,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:41:43,501 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2019-10-01 22:41:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:43,502 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:41:43,502 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:41:43,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:41:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:41:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-01 22:41:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-01 22:41:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-01 22:41:43,507 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2019-10-01 22:41:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:43,507 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-01 22:41:43,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:41:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-01 22:41:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 22:41:43,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:43,509 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:43,509 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash -826512902, now seen corresponding path program 16 times [2019-10-01 22:41:43,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:43,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:43,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:43,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:43,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:43,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 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-01 22:41:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:41:43,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:41:43,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:43,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:41:43,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:41:43,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:43,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:41:43,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:41:43,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:41:43,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:41:43,794 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2019-10-01 22:41:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:43,863 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-10-01 22:41:43,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:41:43,864 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-10-01 22:41:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:43,865 INFO L225 Difference]: With dead ends: 98 [2019-10-01 22:41:43,865 INFO L226 Difference]: Without dead ends: 67 [2019-10-01 22:41:43,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 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-01 22:41:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-01 22:41:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-10-01 22:41:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 22:41:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-01 22:41:43,876 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2019-10-01 22:41:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:43,876 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-01 22:41:43,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:41:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-01 22:41:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-01 22:41:43,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:43,877 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:43,878 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -85968104, now seen corresponding path program 17 times [2019-10-01 22:41:43,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:43,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:43,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:44,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:44,065 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) [2019-10-01 22:41:44,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:45,170 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 22:41:45,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:45,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:41:45,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:41:45,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:45,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:41:45,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:41:45,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:41:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:41:45,214 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 18 states. [2019-10-01 22:41:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:45,293 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-10-01 22:41:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:41:45,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-10-01 22:41:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:45,297 INFO L225 Difference]: With dead ends: 100 [2019-10-01 22:41:45,297 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:41:45,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 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-01 22:41:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:41:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-01 22:41:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 22:41:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-10-01 22:41:45,302 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 61 [2019-10-01 22:41:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:45,303 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-10-01 22:41:45,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:41:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-10-01 22:41:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 22:41:45,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:45,304 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:45,304 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1386988362, now seen corresponding path program 18 times [2019-10-01 22:41:45,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:45,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:45,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:45,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:45,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:45,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:45,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 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-01 22:41:45,530 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:41:48,758 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 22:41:48,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:48,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:41:48,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:41:48,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:48,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:41:48,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:41:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:41:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:41:48,806 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 19 states. [2019-10-01 22:41:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:48,878 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2019-10-01 22:41:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:41:48,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2019-10-01 22:41:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:48,879 INFO L225 Difference]: With dead ends: 102 [2019-10-01 22:41:48,879 INFO L226 Difference]: Without dead ends: 71 [2019-10-01 22:41:48,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 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-01 22:41:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-01 22:41:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-10-01 22:41:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 22:41:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-10-01 22:41:48,885 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-10-01 22:41:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:48,885 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-10-01 22:41:48,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:41:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-10-01 22:41:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:41:48,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:48,886 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:48,886 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:48,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1831973164, now seen corresponding path program 19 times [2019-10-01 22:41:48,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:48,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:48,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:48,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:48,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:49,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:49,101 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-01 22:41:49,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:49,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:41:49,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:41:49,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:49,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:41:49,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:41:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:41:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:41:49,207 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 20 states. [2019-10-01 22:41:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:49,280 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2019-10-01 22:41:49,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:41:49,280 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2019-10-01 22:41:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:49,281 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:41:49,281 INFO L226 Difference]: Without dead ends: 73 [2019-10-01 22:41:49,282 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 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-01 22:41:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-01 22:41:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-01 22:41:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 22:41:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-10-01 22:41:49,286 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 65 [2019-10-01 22:41:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:49,286 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-10-01 22:41:49,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:41:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-10-01 22:41:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:41:49,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:49,287 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:49,287 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash 34361714, now seen corresponding path program 20 times [2019-10-01 22:41:49,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:49,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:49,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:41:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:49,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:49,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 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-01 22:41:49,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:41:49,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:41:49,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:49,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:41:49,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:49,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:49,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:41:49,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:41:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:41:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:41:49,629 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 21 states. [2019-10-01 22:41:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:49,716 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-10-01 22:41:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:41:49,716 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-10-01 22:41:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:49,717 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:41:49,717 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 22:41:49,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 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-01 22:41:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 22:41:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-10-01 22:41:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 22:41:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-10-01 22:41:49,726 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2019-10-01 22:41:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:49,727 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-10-01 22:41:49,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:41:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-10-01 22:41:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 22:41:49,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:49,728 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:49,729 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1714150256, now seen corresponding path program 21 times [2019-10-01 22:41:49,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:49,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:49,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:41:49,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:49,992 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-01 22:41:50,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:41:50,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-01 22:41:50,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:50,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:41:50,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-01 22:41:50,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:50,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2019-10-01 22:41:50,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:41:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:41:50,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:41:50,970 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 31 states. [2019-10-01 22:41:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:51,103 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-10-01 22:41:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:41:51,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2019-10-01 22:41:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:51,105 INFO L225 Difference]: With dead ends: 111 [2019-10-01 22:41:51,105 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 22:41:51,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:41:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 22:41:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-10-01 22:41:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 22:41:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-01 22:41:51,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 69 [2019-10-01 22:41:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:51,110 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-01 22:41:51,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:41:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-01 22:41:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 22:41:51,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:51,112 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:51,112 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:51,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1920162828, now seen corresponding path program 22 times [2019-10-01 22:41:51,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:51,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:51,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:51,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:51,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:41:51,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:51,349 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-01 22:41:51,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:41:51,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:41:51,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:51,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:41:51,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-10-01 22:41:51,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:51,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2019-10-01 22:41:51,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 22:41:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 22:41:51,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=748, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:41:51,619 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 33 states. [2019-10-01 22:41:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:51,799 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-10-01 22:41:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:41:51,800 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2019-10-01 22:41:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:51,801 INFO L225 Difference]: With dead ends: 117 [2019-10-01 22:41:51,801 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:41:51,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=748, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:41:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:41:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-01 22:41:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 22:41:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-10-01 22:41:51,806 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 73 [2019-10-01 22:41:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:51,806 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-10-01 22:41:51,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 22:41:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-10-01 22:41:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 22:41:51,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:51,807 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:51,808 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1293903240, now seen corresponding path program 23 times [2019-10-01 22:41:51,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:51,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:51,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-01 22:41:52,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:52,112 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-01 22:41:52,141 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:41:56,943 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-01 22:41:56,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:56,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:41:56,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-10-01 22:41:57,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:57,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2019-10-01 22:41:57,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:41:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:41:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:41:57,229 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 35 states. [2019-10-01 22:41:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:57,366 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-10-01 22:41:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:41:57,366 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2019-10-01 22:41:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:57,367 INFO L225 Difference]: With dead ends: 123 [2019-10-01 22:41:57,367 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:41:57,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:41:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:41:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-10-01 22:41:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-01 22:41:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-10-01 22:41:57,372 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 77 [2019-10-01 22:41:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:57,373 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-10-01 22:41:57,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:41:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-10-01 22:41:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 22:41:57,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:57,374 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:57,374 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1683799804, now seen corresponding path program 24 times [2019-10-01 22:41:57,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:57,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:57,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-01 22:41:57,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:57,556 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 22:41:57,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:42:17,010 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-10-01 22:42:17,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:17,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:42:17,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:42:17,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:17,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 37 [2019-10-01 22:42:17,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:42:17,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:42:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=952, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:42:17,450 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 37 states. [2019-10-01 22:42:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:17,626 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-10-01 22:42:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:42:17,626 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2019-10-01 22:42:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:17,627 INFO L225 Difference]: With dead ends: 129 [2019-10-01 22:42:17,627 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 22:42:17,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=952, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:42:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 22:42:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-10-01 22:42:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-01 22:42:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-10-01 22:42:17,631 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 81 [2019-10-01 22:42:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:17,631 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-10-01 22:42:17,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:42:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-10-01 22:42:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 22:42:17,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:17,632 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:17,632 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash -515248512, now seen corresponding path program 25 times [2019-10-01 22:42:17,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:17,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:17,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-01 22:42:17,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:17,806 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-01 22:42:17,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:17,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:42:17,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-10-01 22:42:18,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:18,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 39 [2019-10-01 22:42:18,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 22:42:18,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 22:42:18,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:42:18,338 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 39 states. [2019-10-01 22:42:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:18,479 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-10-01 22:42:18,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 22:42:18,480 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2019-10-01 22:42:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:18,481 INFO L225 Difference]: With dead ends: 135 [2019-10-01 22:42:18,481 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:42:18,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:42:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:42:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-10-01 22:42:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-01 22:42:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-01 22:42:18,486 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 85 [2019-10-01 22:42:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:18,486 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-01 22:42:18,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 22:42:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-01 22:42:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-01 22:42:18,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:18,488 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:18,488 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash 853437948, now seen corresponding path program 26 times [2019-10-01 22:42:18,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:42:18,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:18,699 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-01 22:42:18,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:42:18,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:42:18,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:18,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:42:18,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:42:19,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:19,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 41 [2019-10-01 22:42:19,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:42:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:42:19,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:42:19,225 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 41 states. [2019-10-01 22:42:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:19,410 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2019-10-01 22:42:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:42:19,411 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2019-10-01 22:42:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:19,412 INFO L225 Difference]: With dead ends: 141 [2019-10-01 22:42:19,413 INFO L226 Difference]: Without dead ends: 100 [2019-10-01 22:42:19,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:42:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-01 22:42:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-01 22:42:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 22:42:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-01 22:42:19,418 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 89 [2019-10-01 22:42:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:19,418 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-01 22:42:19,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:42:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-01 22:42:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 22:42:19,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:19,419 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:19,420 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:19,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1230258312, now seen corresponding path program 27 times [2019-10-01 22:42:19,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:19,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:19,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:19,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:42:19,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:19,614 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-01 22:42:19,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:42:26,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:42:26,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:26,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:42:26,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:42:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:26,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:42:26,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:42:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:42:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:42:26,890 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 19 states. [2019-10-01 22:42:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:26,962 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-10-01 22:42:26,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:42:26,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-10-01 22:42:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:26,964 INFO L225 Difference]: With dead ends: 112 [2019-10-01 22:42:26,964 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 22:42:26,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 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-01 22:42:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 22:42:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-10-01 22:42:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 22:42:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-10-01 22:42:26,969 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2019-10-01 22:42:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:26,969 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-10-01 22:42:26,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:42:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-10-01 22:42:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 22:42:26,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:26,971 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:26,971 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1132279594, now seen corresponding path program 28 times [2019-10-01 22:42:26,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:26,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:26,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:42:27,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:27,225 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-01 22:42:27,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:42:27,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:42:27,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:27,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:42:27,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-10-01 22:42:27,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:27,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27] total 44 [2019-10-01 22:42:27,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:42:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:42:27,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=1371, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:42:27,764 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 44 states. [2019-10-01 22:42:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:27,958 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2019-10-01 22:42:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 22:42:27,959 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 95 [2019-10-01 22:42:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:27,960 INFO L225 Difference]: With dead ends: 151 [2019-10-01 22:42:27,960 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 22:42:27,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=521, Invalid=1371, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:42:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 22:42:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-10-01 22:42:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 22:42:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-10-01 22:42:27,966 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 95 [2019-10-01 22:42:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:27,966 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-10-01 22:42:27,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:42:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-10-01 22:42:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 22:42:27,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:27,967 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:27,967 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash -90636974, now seen corresponding path program 29 times [2019-10-01 22:42:27,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:27,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:27,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:27,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:27,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-01 22:42:28,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:28,210 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-01 22:42:28,245 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:42:47,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-10-01 22:42:47,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:47,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:42:47,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:42:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28] total 46 [2019-10-01 22:42:47,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:42:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:42:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1503, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:42:47,986 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 46 states. [2019-10-01 22:42:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:48,213 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-10-01 22:42:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:42:48,213 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 99 [2019-10-01 22:42:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:48,214 INFO L225 Difference]: With dead ends: 157 [2019-10-01 22:42:48,214 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 22:42:48,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=567, Invalid=1503, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:42:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 22:42:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-10-01 22:42:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-01 22:42:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-01 22:42:48,230 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 99 [2019-10-01 22:42:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:48,230 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-01 22:42:48,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:42:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-01 22:42:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 22:42:48,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:48,233 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:48,233 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:48,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:48,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1402045390, now seen corresponding path program 30 times [2019-10-01 22:42:48,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:48,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:48,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:48,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:48,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-01 22:42:48,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:48,610 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-01 22:42:48,671 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:44:33,290 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-10-01 22:44:33,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:33,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:44:33,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-01 22:44:33,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:33,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:44:33,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:44:33,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:44:33,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:44:33,395 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 22 states. [2019-10-01 22:44:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:33,458 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2019-10-01 22:44:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:44:33,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2019-10-01 22:44:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:33,460 INFO L225 Difference]: With dead ends: 122 [2019-10-01 22:44:33,460 INFO L226 Difference]: Without dead ends: 111 [2019-10-01 22:44:33,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:44:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-01 22:44:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-10-01 22:44:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 22:44:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-10-01 22:44:33,468 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2019-10-01 22:44:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:33,469 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-10-01 22:44:33,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:44:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-10-01 22:44:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-01 22:44:33,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:33,470 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:33,471 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:33,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:33,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1224159316, now seen corresponding path program 31 times [2019-10-01 22:44:33,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:33,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:33,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:33,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-01 22:44:33,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:33,932 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-01 22:44:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:34,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:44:34,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-10-01 22:44:34,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:34,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29] total 49 [2019-10-01 22:44:34,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:44:34,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:44:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=1716, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:44:34,892 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 49 states. [2019-10-01 22:44:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:35,097 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2019-10-01 22:44:35,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:44:35,098 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 105 [2019-10-01 22:44:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:35,099 INFO L225 Difference]: With dead ends: 167 [2019-10-01 22:44:35,099 INFO L226 Difference]: Without dead ends: 116 [2019-10-01 22:44:35,100 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=636, Invalid=1716, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:44:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-01 22:44:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-10-01 22:44:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 22:44:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-10-01 22:44:35,104 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 105 [2019-10-01 22:44:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:35,105 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-10-01 22:44:35,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:44:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-10-01 22:44:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-01 22:44:35,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:35,106 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:35,106 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1663403736, now seen corresponding path program 32 times [2019-10-01 22:44:35,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:35,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-10-01 22:44:35,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:35,636 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-01 22:44:35,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:44:35,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:44:35,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:35,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:44:35,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-10-01 22:44:35,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:35,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:44:35,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:44:35,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:44:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:44:35,775 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 31 states. [2019-10-01 22:44:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:35,894 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2019-10-01 22:44:35,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:44:35,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2019-10-01 22:44:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:35,896 INFO L225 Difference]: With dead ends: 170 [2019-10-01 22:44:35,896 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 22:44:35,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:44:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 22:44:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-10-01 22:44:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-01 22:44:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-10-01 22:44:35,901 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 109 [2019-10-01 22:44:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:35,902 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-10-01 22:44:35,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:44:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-10-01 22:44:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-01 22:44:35,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:35,903 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:35,903 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1473611462, now seen corresponding path program 33 times [2019-10-01 22:44:35,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:35,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:44:36,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:36,239 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-01 22:44:36,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:44:54,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-10-01 22:44:54,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:54,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:44:54,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:44:54,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:54,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:44:54,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:44:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:44:54,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:44:54,553 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 24 states. [2019-10-01 22:44:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:54,623 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-10-01 22:44:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:44:54,624 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 111 [2019-10-01 22:44:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:54,625 INFO L225 Difference]: With dead ends: 130 [2019-10-01 22:44:54,626 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 22:44:54,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 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-01 22:44:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 22:44:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-10-01 22:44:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-01 22:44:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-10-01 22:44:54,631 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 111 [2019-10-01 22:44:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:54,632 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-10-01 22:44:54,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:44:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-10-01 22:44:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-01 22:44:54,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:54,633 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:54,633 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1168640860, now seen corresponding path program 34 times [2019-10-01 22:44:54,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:54,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:54,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:44:54,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:54,994 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-01 22:44:55,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:44:55,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:44:55,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:55,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:44:55,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-01 22:44:55,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:55,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 53 [2019-10-01 22:44:55,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:44:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:44:55,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=2016, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:44:55,979 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 53 states. [2019-10-01 22:44:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:56,218 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2019-10-01 22:44:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:44:56,222 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 113 [2019-10-01 22:44:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:56,223 INFO L225 Difference]: With dead ends: 179 [2019-10-01 22:44:56,223 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 22:44:56,225 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=740, Invalid=2016, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:44:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 22:44:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-01 22:44:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-01 22:44:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-10-01 22:44:56,232 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 113 [2019-10-01 22:44:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:56,236 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-10-01 22:44:56,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:44:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-10-01 22:44:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 22:44:56,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:56,239 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:56,240 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 801915424, now seen corresponding path program 35 times [2019-10-01 22:44:56,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:56,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:56,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-01 22:44:56,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:56,892 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-01 22:44:56,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:47:00,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 22:47:00,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:47:00,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:47:00,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:47:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-10-01 22:47:01,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:47:01,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 55 [2019-10-01 22:47:01,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:47:01,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:47:01,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=795, Invalid=2175, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:47:01,113 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 55 states. [2019-10-01 22:47:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:47:01,401 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-10-01 22:47:01,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:47:01,401 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2019-10-01 22:47:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:47:01,402 INFO L225 Difference]: With dead ends: 185 [2019-10-01 22:47:01,402 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 22:47:01,404 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=795, Invalid=2175, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:47:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 22:47:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-10-01 22:47:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 22:47:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-10-01 22:47:01,408 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 117 [2019-10-01 22:47:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:47:01,409 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-10-01 22:47:01,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:47:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-10-01 22:47:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-01 22:47:01,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:47:01,410 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:47:01,410 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:47:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:47:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1862427036, now seen corresponding path program 36 times [2019-10-01 22:47:01,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:47:01,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:47:01,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:01,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:47:01,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:47:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:47:01,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:47:01,903 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-01 22:47:01,953 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:48:30,471 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-01 22:48:30,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:48:30,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:48:30,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:48:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:48:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:48:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 22:48:30,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:48:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:48:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:48:30,542 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 34 states. [2019-10-01 22:48:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:48:30,681 INFO L93 Difference]: Finished difference Result 188 states and 192 transitions. [2019-10-01 22:48:30,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:48:30,682 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 121 [2019-10-01 22:48:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:48:30,683 INFO L225 Difference]: With dead ends: 188 [2019-10-01 22:48:30,683 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 22:48:30,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:48:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 22:48:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-10-01 22:48:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 22:48:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-10-01 22:48:30,689 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 121 [2019-10-01 22:48:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:48:30,689 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-10-01 22:48:30,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:48:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-10-01 22:48:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 22:48:30,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:48:30,690 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:48:30,690 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:48:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:48:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1706029626, now seen corresponding path program 37 times [2019-10-01 22:48:30,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:48:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:48:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:30,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:48:30,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:48:31,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:48:31,346 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-01 22:48:31,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:48:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:31,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:48:31,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:48:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:48:31,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:48:31,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:48:31,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:48:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:48:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:48:31,523 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 35 states. [2019-10-01 22:48:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:48:31,646 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2019-10-01 22:48:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:48:31,647 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 123 [2019-10-01 22:48:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:48:31,647 INFO L225 Difference]: With dead ends: 190 [2019-10-01 22:48:31,647 INFO L226 Difference]: Without dead ends: 131 [2019-10-01 22:48:31,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:48:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-01 22:48:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-10-01 22:48:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-01 22:48:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-10-01 22:48:31,653 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2019-10-01 22:48:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:48:31,654 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-10-01 22:48:31,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:48:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-10-01 22:48:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-01 22:48:31,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:48:31,655 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:48:31,655 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:48:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:48:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1731973976, now seen corresponding path program 38 times [2019-10-01 22:48:31,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:48:31,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:48:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:31,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:48:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:48:32,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:48:32,197 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-01 22:48:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:48:32,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:48:32,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:48:32,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:48:32,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:48:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:48:32,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:48:32,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:48:32,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:48:32,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:48:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:48:32,363 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 36 states. [2019-10-01 22:48:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:48:32,479 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2019-10-01 22:48:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:48:32,480 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 125 [2019-10-01 22:48:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:48:32,481 INFO L225 Difference]: With dead ends: 192 [2019-10-01 22:48:32,481 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 22:48:32,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 125 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-01 22:48:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 22:48:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-10-01 22:48:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-01 22:48:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2019-10-01 22:48:32,485 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 125 [2019-10-01 22:48:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:48:32,486 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2019-10-01 22:48:32,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:48:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2019-10-01 22:48:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-01 22:48:32,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:48:32,487 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:48:32,487 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:48:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:48:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 894690550, now seen corresponding path program 39 times [2019-10-01 22:48:32,487 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:48:32,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:48:32,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:32,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:48:32,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:48:33,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:48:33,031 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-01 22:48:33,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:49:57,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-01 22:49:57,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:49:57,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:49:57,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:49:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-10-01 22:49:57,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:49:57,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 26] total 60 [2019-10-01 22:49:57,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:49:57,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:49:57,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=954, Invalid=2586, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:49:57,835 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 60 states. [2019-10-01 22:49:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:49:58,115 INFO L93 Difference]: Finished difference Result 197 states and 202 transitions. [2019-10-01 22:49:58,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:49:58,117 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 127 [2019-10-01 22:49:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:49:58,118 INFO L225 Difference]: With dead ends: 197 [2019-10-01 22:49:58,118 INFO L226 Difference]: Without dead ends: 138 [2019-10-01 22:49:58,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=954, Invalid=2586, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:49:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-01 22:49:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-01 22:49:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-01 22:49:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-10-01 22:49:58,124 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 127 [2019-10-01 22:49:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:49:58,124 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-10-01 22:49:58,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:49:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-10-01 22:49:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 22:49:58,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:49:58,125 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:49:58,125 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:49:58,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:49:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash 739350898, now seen corresponding path program 40 times [2019-10-01 22:49:58,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:49:58,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:49:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:58,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:49:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:49:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1732 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:49:58,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:49:58,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 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-01 22:49:58,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:49:58,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:49:58,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:49:58,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:49:58,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:49:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1732 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:49:58,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:49:58,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 22:49:58,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:49:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:49:58,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:49:58,920 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 38 states. [2019-10-01 22:49:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:49:59,070 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2019-10-01 22:49:59,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:49:59,071 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 131 [2019-10-01 22:49:59,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:49:59,072 INFO L225 Difference]: With dead ends: 200 [2019-10-01 22:49:59,072 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 22:49:59,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 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-01 22:49:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 22:49:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-10-01 22:49:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-01 22:49:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-10-01 22:49:59,077 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 131 [2019-10-01 22:49:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:49:59,078 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-10-01 22:49:59,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:49:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-10-01 22:49:59,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-01 22:49:59,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:49:59,079 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:49:59,079 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:49:59,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:49:59,080 INFO L82 PathProgramCache]: Analyzing trace with hash -130974576, now seen corresponding path program 41 times [2019-10-01 22:49:59,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:49:59,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:49:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:59,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:49:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:49:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:49:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:49:59,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:49:59,686 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-01 22:49:59,746 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:52:23,393 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 22:52:23,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:52:23,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 22:52:23,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:52:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:52:23,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:52:23,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 22:52:23,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 22:52:23,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 22:52:23,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:52:23,511 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 39 states. [2019-10-01 22:52:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:52:23,642 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2019-10-01 22:52:23,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:52:23,643 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 133 [2019-10-01 22:52:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:52:23,644 INFO L225 Difference]: With dead ends: 202 [2019-10-01 22:52:23,644 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 22:52:23,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:52:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 22:52:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-10-01 22:52:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-01 22:52:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-10-01 22:52:23,648 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 133 [2019-10-01 22:52:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:52:23,649 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-10-01 22:52:23,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 22:52:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-10-01 22:52:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 22:52:23,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:52:23,649 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:52:23,650 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:52:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:52:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1004867630, now seen corresponding path program 42 times [2019-10-01 22:52:23,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:52:23,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:52:23,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:23,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:52:23,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:52:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:52:24,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:52:24,242 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-01 22:52:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:55:55,000 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-10-01 22:55:55,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:55:55,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:55:55,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:55:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-10-01 22:55:55,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:55:55,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 27] total 64 [2019-10-01 22:55:55,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 22:55:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 22:55:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=2941, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:55:55,742 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 64 states. [2019-10-01 22:55:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:55:56,066 INFO L93 Difference]: Finished difference Result 207 states and 212 transitions. [2019-10-01 22:55:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 22:55:56,067 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 135 [2019-10-01 22:55:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:55:56,068 INFO L225 Difference]: With dead ends: 207 [2019-10-01 22:55:56,068 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 22:55:56,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1091, Invalid=2941, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:55:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 22:55:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-10-01 22:55:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-01 22:55:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-10-01 22:55:56,072 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 135 [2019-10-01 22:55:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:55:56,072 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-10-01 22:55:56,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 22:55:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-10-01 22:55:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-01 22:55:56,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:55:56,074 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:55:56,074 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:55:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:55:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash 722426026, now seen corresponding path program 43 times [2019-10-01 22:55:56,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:55:56,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:55:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:56,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:55:56,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:55:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-01 22:55:56,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:55:56,738 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-01 22:55:56,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:55:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:55:56,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:55:56,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:55:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-01 22:55:56,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:55:56,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:55:56,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:55:56,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:55:56,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:55:56,927 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 41 states. [2019-10-01 22:55:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:55:57,068 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-10-01 22:55:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:55:57,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 139 [2019-10-01 22:55:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:55:57,070 INFO L225 Difference]: With dead ends: 210 [2019-10-01 22:55:57,070 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 22:55:57,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:55:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 22:55:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-10-01 22:55:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-01 22:55:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-10-01 22:55:57,076 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 139 [2019-10-01 22:55:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:55:57,076 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-10-01 22:55:57,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:55:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-10-01 22:55:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-01 22:55:57,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:55:57,078 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:55:57,078 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:55:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:55:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1990278600, now seen corresponding path program 44 times [2019-10-01 22:55:57,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:55:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:55:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:57,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:55:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:55:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2069 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-01 22:55:57,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:55:57,788 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-01 22:55:57,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:55:57,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:55:57,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:55:57,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:55:57,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:55:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2069 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:55:57,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:55:57,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:55:57,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:55:57,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:55:57,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:55:57,971 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 42 states. [2019-10-01 22:55:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:55:58,177 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2019-10-01 22:55:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:55:58,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-10-01 22:55:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:55:58,178 INFO L225 Difference]: With dead ends: 212 [2019-10-01 22:55:58,178 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 22:55:58,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:55:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 22:55:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-10-01 22:55:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-01 22:55:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-10-01 22:55:58,182 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 141 [2019-10-01 22:55:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:55:58,183 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-10-01 22:55:58,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:55:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-10-01 22:55:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 22:55:58,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:55:58,184 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:55:58,184 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:55:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:55:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash 625890150, now seen corresponding path program 45 times [2019-10-01 22:55:58,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:55:58,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:55:58,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:58,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:55:58,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:55:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-01 22:55:58,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:55:58,856 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-01 22:55:58,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2