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_minInArray_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:13:58,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:13:58,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:13:58,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:13:58,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:13:58,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:13:58,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:13:58,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:13:58,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:13:58,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:13:58,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:13:58,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:13:58,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:13:58,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:13:58,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:13:58,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:13:58,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:13:58,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:13:58,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:13:58,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:13:58,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:13:58,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:13:58,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:13:58,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:13:58,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:13:58,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:13:58,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:13:58,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:13:58,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:13:58,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:13:58,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:13:58,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:13:58,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:13:58,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:13:58,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:13:58,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:13:58,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:13:58,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:13:58,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:13:58,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:13:58,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:13:58,706 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-09-07 10:13:58,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:13:58,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:13:58,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:13:58,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:13:58,739 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:13:58,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:13:58,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:13:58,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:13:58,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:13:58,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:13:58,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:13:58,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:13:58,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:13:58,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:13:58,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:13:58,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:13:58,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:13:58,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:13:58,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:13:58,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:13:58,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:13:58,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:13:58,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:13:58,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:13:58,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:13:58,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:13:58,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:13:58,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:13:58,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:13:58,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:13:58,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:13:58,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:13:58,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:13:58,822 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:13:58,823 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-1.i [2019-09-07 10:13:58,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bb4addb/447897369c0946f2825557da6e84a3f7/FLAG52cb15b61 [2019-09-07 10:13:59,402 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:13:59,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_ground-1.i [2019-09-07 10:13:59,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bb4addb/447897369c0946f2825557da6e84a3f7/FLAG52cb15b61 [2019-09-07 10:13:59,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bb4addb/447897369c0946f2825557da6e84a3f7 [2019-09-07 10:13:59,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:13:59,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:13:59,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:13:59,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:13:59,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:13:59,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:13:59" (1/1) ... [2019-09-07 10:13:59,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f97b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:13:59, skipping insertion in model container [2019-09-07 10:13:59,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:13:59" (1/1) ... [2019-09-07 10:13:59,762 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:13:59,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:13:59,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:13:59,976 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:13:59,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:14:00,015 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:14:00,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00 WrapperNode [2019-09-07 10:14:00,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:14:00,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:14:00,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:14:00,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:14:00,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... [2019-09-07 10:14:00,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... [2019-09-07 10:14:00,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... [2019-09-07 10:14:00,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... [2019-09-07 10:14:00,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... [2019-09-07 10:14:00,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... [2019-09-07 10:14:00,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... [2019-09-07 10:14:00,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:14:00,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:14:00,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:14:00,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:14:00,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:14:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:14:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:14:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:14:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:14:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:14:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:14:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:14:00,473 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:14:00,473 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:14:00,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:14:00 BoogieIcfgContainer [2019-09-07 10:14:00,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:14:00,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:14:00,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:14:00,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:14:00,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:13:59" (1/3) ... [2019-09-07 10:14:00,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1728722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:14:00, skipping insertion in model container [2019-09-07 10:14:00,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:14:00" (2/3) ... [2019-09-07 10:14:00,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1728722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:14:00, skipping insertion in model container [2019-09-07 10:14:00,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:14:00" (3/3) ... [2019-09-07 10:14:00,485 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_minInArray_ground-1.i [2019-09-07 10:14:00,498 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:14:00,506 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:14:00,525 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:14:00,564 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:14:00,564 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:14:00,565 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:14:00,565 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:14:00,565 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:14:00,565 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:14:00,565 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:14:00,565 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:14:00,566 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:14:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-07 10:14:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:14:00,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:00,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:00,595 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1241254978, now seen corresponding path program 1 times [2019-09-07 10:14:00,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:00,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:00,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:14:00,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:14:00,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:14:00,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:14:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:14:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:14:00,755 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-07 10:14:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:00,783 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-09-07 10:14:00,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:14:00,785 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:14:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:00,794 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:14:00,795 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 10:14:00,799 INFO L628 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-09-07 10:14:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 10:14:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-07 10:14:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 10:14:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-07 10:14:00,844 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2019-09-07 10:14:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:00,845 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-07 10:14:00,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:14:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-07 10:14:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:14:00,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:00,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:00,847 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:00,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:00,849 INFO L82 PathProgramCache]: Analyzing trace with hash -159068691, now seen corresponding path program 1 times [2019-09-07 10:14:00,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:00,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:14:00,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:14:00,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:14:00,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:14:00,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:14:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:14:00,909 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-09-07 10:14:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:00,930 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-07 10:14:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:14:00,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:14:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:00,932 INFO L225 Difference]: With dead ends: 40 [2019-09-07 10:14:00,932 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:14:00,934 INFO L628 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-09-07 10:14:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:14:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-07 10:14:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:14:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-07 10:14:00,941 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-09-07 10:14:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:00,941 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-07 10:14:00,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:14:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-07 10:14:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:14:00,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:00,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:00,943 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:00,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:00,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1675123339, now seen corresponding path program 1 times [2019-09-07 10:14:00,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:00,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:00,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:00,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:14:01,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:14:01,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:14:01,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:14:01,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:14:01,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:14:01,030 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-09-07 10:14:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:01,073 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-07 10:14:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:14:01,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 10:14:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:01,077 INFO L225 Difference]: With dead ends: 38 [2019-09-07 10:14:01,077 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 10:14:01,078 INFO L628 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-09-07 10:14:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 10:14:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-07 10:14:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:14:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-07 10:14:01,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-09-07 10:14:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:01,094 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-07 10:14:01,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:14:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-07 10:14:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:14:01,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:01,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:01,097 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 99818017, now seen corresponding path program 1 times [2019-09-07 10:14:01,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:01,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:14:01,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:01,188 INFO L223 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) [2019-09-07 10:14:01,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:01,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:14:01,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:14:01,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:01,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:14:01,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:14:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:14:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:14:01,310 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-07 10:14:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:01,359 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-09-07 10:14:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:14:01,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-07 10:14:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:01,363 INFO L225 Difference]: With dead ends: 44 [2019-09-07 10:14:01,363 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 10:14:01,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:14:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 10:14:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 10:14:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 10:14:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-07 10:14:01,377 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-09-07 10:14:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:01,378 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-07 10:14:01,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:14:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-07 10:14:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 10:14:01,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:01,379 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:01,379 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash -392904637, now seen corresponding path program 2 times [2019-09-07 10:14:01,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:14:01,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:01,479 INFO L223 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-09-07 10:14:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:01,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:01,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:01,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:14:01,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:01,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:01,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 10:14:01,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:14:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:14:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:14:01,588 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-09-07 10:14:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:01,666 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-09-07 10:14:01,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:14:01,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-07 10:14:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:01,668 INFO L225 Difference]: With dead ends: 51 [2019-09-07 10:14:01,669 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 10:14:01,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:14:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 10:14:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-09-07 10:14:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:14:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-07 10:14:01,677 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-09-07 10:14:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:01,677 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-07 10:14:01,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:14:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-07 10:14:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:14:01,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:01,679 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:01,679 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1100015481, now seen corresponding path program 3 times [2019-09-07 10:14:01,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:01,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:14:01,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:01,764 INFO L223 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-09-07 10:14:01,783 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-09-07 10:14:01,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:14:01,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:01,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:14:01,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:14:01,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:01,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:14:01,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:14:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:14:01,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:14:01,840 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-07 10:14:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:01,889 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-07 10:14:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:14:01,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-07 10:14:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:01,891 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:14:01,891 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:14:01,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-09-07 10:14:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:14:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 10:14:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 10:14:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-09-07 10:14:01,898 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 27 [2019-09-07 10:14:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:01,899 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-09-07 10:14:01,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:14:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-09-07 10:14:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 10:14:01,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:01,900 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:01,900 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:01,901 INFO L82 PathProgramCache]: Analyzing trace with hash -235287899, now seen corresponding path program 4 times [2019-09-07 10:14:01,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:01,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:01,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 10:14:02,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:02,001 INFO L223 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-09-07 10:14:02,022 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-09-07 10:14:02,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:02,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:02,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:14:02,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 10:14:02,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:02,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:14:02,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:14:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:14:02,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:14:02,101 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2019-09-07 10:14:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:02,157 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-09-07 10:14:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:14:02,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-07 10:14:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:02,159 INFO L225 Difference]: With dead ends: 60 [2019-09-07 10:14:02,159 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 10:14:02,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:14:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 10:14:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-07 10:14:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 10:14:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-09-07 10:14:02,174 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 30 [2019-09-07 10:14:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:02,175 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-09-07 10:14:02,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:14:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-09-07 10:14:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 10:14:02,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:02,179 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:02,179 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash -777802169, now seen corresponding path program 5 times [2019-09-07 10:14:02,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:02,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:14:02,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:02,305 INFO L223 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-09-07 10:14:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:02,363 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 10:14:02,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:02,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:14:02,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:14:02,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:02,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:14:02,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:14:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:14:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:14:02,398 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 7 states. [2019-09-07 10:14:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:02,451 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-09-07 10:14:02,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:14:02,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-07 10:14:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:02,453 INFO L225 Difference]: With dead ends: 53 [2019-09-07 10:14:02,453 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:14:02,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:14:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:14:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-07 10:14:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:14:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-09-07 10:14:02,468 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2019-09-07 10:14:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:02,468 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-09-07 10:14:02,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:14:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-09-07 10:14:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:14:02,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:02,471 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:02,471 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -430416667, now seen corresponding path program 6 times [2019-09-07 10:14:02,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:02,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:14:02,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:02,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:02,597 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:02,625 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 10:14:02,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:02,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:14:02,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:14:02,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:02,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:14:02,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:14:02,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:14:02,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:14:02,653 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-09-07 10:14:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:02,699 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-09-07 10:14:02,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:14:02,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-07 10:14:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:02,702 INFO L225 Difference]: With dead ends: 68 [2019-09-07 10:14:02,702 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 10:14:02,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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-09-07 10:14:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 10:14:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-07 10:14:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 10:14:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-07 10:14:02,709 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2019-09-07 10:14:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:02,709 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-07 10:14:02,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:14:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-07 10:14:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 10:14:02,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:02,711 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:02,711 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash -657101181, now seen corresponding path program 7 times [2019-09-07 10:14:02,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:14:02,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:02,782 INFO L223 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-09-07 10:14:02,797 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-09-07 10:14:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:02,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:14:02,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:14:02,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:02,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 10:14:02,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:14:02,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:14:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:14:02,902 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 13 states. [2019-09-07 10:14:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:02,982 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-09-07 10:14:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:14:02,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-09-07 10:14:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:02,984 INFO L225 Difference]: With dead ends: 75 [2019-09-07 10:14:02,984 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 10:14:02,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:14:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 10:14:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-07 10:14:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:14:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-09-07 10:14:02,991 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 37 [2019-09-07 10:14:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:02,992 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-09-07 10:14:02,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:14:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-09-07 10:14:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 10:14:02,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:02,993 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:02,994 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1082991691, now seen corresponding path program 8 times [2019-09-07 10:14:02,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:02,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:02,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:02,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:14:03,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:03,094 INFO L223 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-09-07 10:14:03,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:03,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:03,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:03,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:14:03,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 10:14:03,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:03,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 10:14:03,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:14:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:14:03,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:14:03,262 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 15 states. [2019-09-07 10:14:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:03,359 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-09-07 10:14:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:14:03,360 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-09-07 10:14:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:03,362 INFO L225 Difference]: With dead ends: 83 [2019-09-07 10:14:03,362 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 10:14:03,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:14:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 10:14:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-09-07 10:14:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:14:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-09-07 10:14:03,368 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 42 [2019-09-07 10:14:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:03,369 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-09-07 10:14:03,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:14:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-09-07 10:14:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:14:03,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:03,370 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:03,370 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1481171841, now seen corresponding path program 9 times [2019-09-07 10:14:03,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:03,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:03,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:03,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:03,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:14:03,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:03,472 INFO L223 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-09-07 10:14:03,503 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-09-07 10:14:03,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:14:03,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:03,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:14:03,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:14:03,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:03,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:14:03,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:14:03,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:14:03,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:14:03,597 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 10 states. [2019-09-07 10:14:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:03,653 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-09-07 10:14:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:14:03,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-09-07 10:14:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:03,655 INFO L225 Difference]: With dead ends: 68 [2019-09-07 10:14:03,655 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 10:14:03,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 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-09-07 10:14:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 10:14:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-07 10:14:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 10:14:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-09-07 10:14:03,662 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 47 [2019-09-07 10:14:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:03,663 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-09-07 10:14:03,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:14:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-09-07 10:14:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 10:14:03,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:03,664 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:03,665 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 629121965, now seen corresponding path program 10 times [2019-09-07 10:14:03,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:03,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:03,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:14:03,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:03,768 INFO L223 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) [2019-09-07 10:14:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:03,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:03,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:03,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:14:03,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:03,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:03,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:14:03,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:14:03,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:14:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:14:03,860 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2019-09-07 10:14:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:03,911 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2019-09-07 10:14:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:14:03,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-07 10:14:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:03,912 INFO L225 Difference]: With dead ends: 92 [2019-09-07 10:14:03,912 INFO L226 Difference]: Without dead ends: 58 [2019-09-07 10:14:03,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 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-09-07 10:14:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-07 10:14:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-07 10:14:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-07 10:14:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-09-07 10:14:03,930 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 50 [2019-09-07 10:14:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:03,930 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-09-07 10:14:03,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:14:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-09-07 10:14:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 10:14:03,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:03,932 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:03,932 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 824533583, now seen corresponding path program 11 times [2019-09-07 10:14:03,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:03,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:03,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:14:04,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:04,071 INFO L223 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-09-07 10:14:04,100 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:04,199 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-07 10:14:04,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:04,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:14:04,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:14:04,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:04,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 10:14:04,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:14:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:14:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:14:04,358 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 19 states. [2019-09-07 10:14:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:04,488 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-09-07 10:14:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:14:04,490 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-07 10:14:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:04,491 INFO L225 Difference]: With dead ends: 99 [2019-09-07 10:14:04,491 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 10:14:04,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:14:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 10:14:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-09-07 10:14:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 10:14:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-09-07 10:14:04,503 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 52 [2019-09-07 10:14:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:04,504 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-09-07 10:14:04,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:14:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-09-07 10:14:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:14:04,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:04,505 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:04,505 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:04,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash -574627205, now seen corresponding path program 12 times [2019-09-07 10:14:04,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:04,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:14:04,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:04,596 INFO L223 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-09-07 10:14:04,610 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:04,679 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 10:14:04,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:04,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:14:04,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-07 10:14:04,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:04,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 10:14:04,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:14:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:14:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:04,856 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 21 states. [2019-09-07 10:14:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:04,965 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2019-09-07 10:14:04,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:14:04,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-09-07 10:14:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:04,967 INFO L225 Difference]: With dead ends: 107 [2019-09-07 10:14:04,967 INFO L226 Difference]: Without dead ends: 70 [2019-09-07 10:14:04,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-07 10:14:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-09-07 10:14:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 10:14:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-09-07 10:14:04,974 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 57 [2019-09-07 10:14:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:04,974 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-09-07 10:14:04,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:14:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-09-07 10:14:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 10:14:04,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:04,975 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:04,976 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1556043693, now seen corresponding path program 13 times [2019-09-07 10:14:04,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:04,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:04,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:04,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:14:05,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:05,115 INFO L223 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-09-07 10:14:05,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:05,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:14:05,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-07 10:14:05,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:05,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 10:14:05,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:14:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:14:05,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:05,351 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 23 states. [2019-09-07 10:14:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:05,472 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2019-09-07 10:14:05,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:14:05,473 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-07 10:14:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:05,474 INFO L225 Difference]: With dead ends: 115 [2019-09-07 10:14:05,474 INFO L226 Difference]: Without dead ends: 75 [2019-09-07 10:14:05,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-07 10:14:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-09-07 10:14:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 10:14:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-09-07 10:14:05,481 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 62 [2019-09-07 10:14:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:05,481 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-09-07 10:14:05,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:14:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-09-07 10:14:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:14:05,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:05,482 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:05,483 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1738244215, now seen corresponding path program 14 times [2019-09-07 10:14:05,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:05,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:05,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:05,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:14:05,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:05,594 INFO L223 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) [2019-09-07 10:14:05,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:05,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:05,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:05,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:14:05,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-07 10:14:05,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:05,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 10:14:05,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:14:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:14:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:14:05,837 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 25 states. [2019-09-07 10:14:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:05,959 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2019-09-07 10:14:05,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:14:05,960 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-09-07 10:14:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:05,961 INFO L225 Difference]: With dead ends: 123 [2019-09-07 10:14:05,961 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 10:14:05,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:14:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 10:14:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-09-07 10:14:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 10:14:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2019-09-07 10:14:05,971 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 67 [2019-09-07 10:14:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:05,972 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2019-09-07 10:14:05,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:14:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2019-09-07 10:14:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 10:14:05,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:05,973 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:05,973 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash 515061335, now seen corresponding path program 15 times [2019-09-07 10:14:05,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:05,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:05,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:14:06,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:06,103 INFO L223 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-09-07 10:14:06,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:14:06,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:14:06,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:06,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:14:06,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:14:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:14:06,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:14:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:14:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:14:06,269 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 15 states. [2019-09-07 10:14:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:06,359 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2019-09-07 10:14:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:14:06,360 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-09-07 10:14:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:06,361 INFO L225 Difference]: With dead ends: 93 [2019-09-07 10:14:06,362 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 10:14:06,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-09-07 10:14:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 10:14:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-09-07 10:14:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 10:14:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2019-09-07 10:14:06,368 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 72 [2019-09-07 10:14:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:06,369 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2019-09-07 10:14:06,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:14:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2019-09-07 10:14:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:14:06,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:06,370 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:06,371 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:06,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2000479531, now seen corresponding path program 16 times [2019-09-07 10:14:06,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:06,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:06,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:06,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:14:06,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:06,536 INFO L223 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-09-07 10:14:06,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:14:06,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:06,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:06,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:14:06,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:14:06,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:06,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-09-07 10:14:06,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:14:06,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:14:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:14:06,769 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand 28 states. [2019-09-07 10:14:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:06,910 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2019-09-07 10:14:06,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:14:06,913 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-09-07 10:14:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:06,914 INFO L225 Difference]: With dead ends: 137 [2019-09-07 10:14:06,914 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 10:14:06,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:14:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 10:14:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-09-07 10:14:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 10:14:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2019-09-07 10:14:06,919 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 75 [2019-09-07 10:14:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:06,920 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2019-09-07 10:14:06,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:14:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2019-09-07 10:14:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 10:14:06,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:06,921 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:06,921 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:06,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:06,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1518163257, now seen corresponding path program 17 times [2019-09-07 10:14:06,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:06,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:06,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:06,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:06,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 10:14:07,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:07,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:07,115 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:07,426 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 10:14:07,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:07,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:14:07,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 10:14:07,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:07,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-09-07 10:14:07,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:14:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:14:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:14:07,719 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 30 states. [2019-09-07 10:14:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:07,866 INFO L93 Difference]: Finished difference Result 145 states and 178 transitions. [2019-09-07 10:14:07,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:14:07,867 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2019-09-07 10:14:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:07,868 INFO L225 Difference]: With dead ends: 145 [2019-09-07 10:14:07,868 INFO L226 Difference]: Without dead ends: 93 [2019-09-07 10:14:07,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:14:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-07 10:14:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-09-07 10:14:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-07 10:14:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2019-09-07 10:14:07,874 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 80 [2019-09-07 10:14:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:07,874 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2019-09-07 10:14:07,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:14:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2019-09-07 10:14:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 10:14:07,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:07,875 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:07,876 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1298601553, now seen corresponding path program 18 times [2019-09-07 10:14:07,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:07,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:07,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-07 10:14:08,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:08,044 INFO L223 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-09-07 10:14:08,060 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:08,248 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-07 10:14:08,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:08,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:14:08,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:14:08,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-09-07 10:14:08,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:14:08,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:14:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:14:08,575 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 32 states. [2019-09-07 10:14:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:08,726 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2019-09-07 10:14:08,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:14:08,728 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 85 [2019-09-07 10:14:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:08,729 INFO L225 Difference]: With dead ends: 153 [2019-09-07 10:14:08,729 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 10:14:08,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:14:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 10:14:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2019-09-07 10:14:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 10:14:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2019-09-07 10:14:08,734 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 85 [2019-09-07 10:14:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:08,735 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2019-09-07 10:14:08,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:14:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2019-09-07 10:14:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 10:14:08,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:08,736 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:08,736 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1896101309, now seen corresponding path program 19 times [2019-09-07 10:14:08,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:08,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:08,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 10:14:08,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:08,957 INFO L223 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) [2019-09-07 10:14:08,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:09,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:14:09,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 10:14:09,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:09,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:14:09,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:14:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:14:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:14:09,105 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 19 states. [2019-09-07 10:14:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:09,186 INFO L93 Difference]: Finished difference Result 156 states and 190 transitions. [2019-09-07 10:14:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:14:09,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 90 [2019-09-07 10:14:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:09,190 INFO L225 Difference]: With dead ends: 156 [2019-09-07 10:14:09,190 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 10:14:09,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 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-09-07 10:14:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 10:14:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-07 10:14:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 10:14:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-09-07 10:14:09,195 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 90 [2019-09-07 10:14:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:09,195 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-09-07 10:14:09,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:14:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-09-07 10:14:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 10:14:09,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:09,196 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:09,197 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash 284109407, now seen corresponding path program 20 times [2019-09-07 10:14:09,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:09,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 10:14:09,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:09,414 INFO L223 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-09-07 10:14:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:09,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:09,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:09,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:14:09,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 10:14:09,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:09,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-09-07 10:14:09,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:14:09,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:14:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:09,817 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 35 states. [2019-09-07 10:14:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:09,997 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2019-09-07 10:14:09,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:14:09,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 92 [2019-09-07 10:14:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:10,000 INFO L225 Difference]: With dead ends: 163 [2019-09-07 10:14:10,000 INFO L226 Difference]: Without dead ends: 105 [2019-09-07 10:14:10,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-07 10:14:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-09-07 10:14:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 10:14:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2019-09-07 10:14:10,006 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 92 [2019-09-07 10:14:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:10,006 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2019-09-07 10:14:10,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:14:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2019-09-07 10:14:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 10:14:10,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:10,008 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:10,008 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash -858461589, now seen corresponding path program 21 times [2019-09-07 10:14:10,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:10,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:10,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 10:14:10,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:10,253 INFO L223 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-09-07 10:14:10,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:14:10,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 10:14:10,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:10,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:14:10,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 10:14:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:10,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:14:10,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:14:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:14:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:14:10,674 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 20 states. [2019-09-07 10:14:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:10,750 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2019-09-07 10:14:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:14:10,751 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-09-07 10:14:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:10,752 INFO L225 Difference]: With dead ends: 118 [2019-09-07 10:14:10,752 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 10:14:10,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:14:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 10:14:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-09-07 10:14:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-07 10:14:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-09-07 10:14:10,757 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 97 [2019-09-07 10:14:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:10,758 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-09-07 10:14:10,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:14:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-09-07 10:14:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 10:14:10,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:10,759 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:10,759 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:10,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:10,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1826487873, now seen corresponding path program 22 times [2019-09-07 10:14:10,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:10,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:10,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:10,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-07 10:14:10,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:10,998 INFO L223 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) [2019-09-07 10:14:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:11,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:11,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:11,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:14:11,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:14:11,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:11,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:14:11,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:14:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:14:11,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:11,098 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 21 states. [2019-09-07 10:14:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:11,164 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2019-09-07 10:14:11,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:14:11,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2019-09-07 10:14:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:11,166 INFO L225 Difference]: With dead ends: 172 [2019-09-07 10:14:11,166 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 10:14:11,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 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-09-07 10:14:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 10:14:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-07 10:14:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-07 10:14:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-09-07 10:14:11,171 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 100 [2019-09-07 10:14:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:11,171 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-09-07 10:14:11,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:14:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2019-09-07 10:14:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 10:14:11,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:11,172 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:11,173 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash -480178077, now seen corresponding path program 23 times [2019-09-07 10:14:11,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:11,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:11,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 10:14:11,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:11,400 INFO L223 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-09-07 10:14:11,414 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:11,753 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 10:14:11,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:11,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:14:11,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:12,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:12,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 10:14:12,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:14:12,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:14:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:14:12,128 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand 39 states. [2019-09-07 10:14:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:12,344 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2019-09-07 10:14:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:14:12,345 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2019-09-07 10:14:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:12,346 INFO L225 Difference]: With dead ends: 179 [2019-09-07 10:14:12,347 INFO L226 Difference]: Without dead ends: 115 [2019-09-07 10:14:12,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:14:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-07 10:14:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-09-07 10:14:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 10:14:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2019-09-07 10:14:12,353 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 102 [2019-09-07 10:14:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:12,353 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2019-09-07 10:14:12,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:14:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2019-09-07 10:14:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:14:12,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:12,354 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:12,354 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1622239335, now seen corresponding path program 24 times [2019-09-07 10:14:12,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:12,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:12,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:12,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:12,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 10:14:12,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:12,626 INFO L223 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-09-07 10:14:12,637 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:13,469 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-07 10:14:13,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:13,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:14:13,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 10:14:13,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:13,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:14:13,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:14:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:14:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:14:13,496 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 22 states. [2019-09-07 10:14:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:13,588 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2019-09-07 10:14:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:14:13,589 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-09-07 10:14:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:13,590 INFO L225 Difference]: With dead ends: 128 [2019-09-07 10:14:13,590 INFO L226 Difference]: Without dead ends: 117 [2019-09-07 10:14:13,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:14:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-07 10:14:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-09-07 10:14:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-07 10:14:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2019-09-07 10:14:13,597 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 107 [2019-09-07 10:14:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:13,597 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2019-09-07 10:14:13,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:14:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2019-09-07 10:14:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 10:14:13,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:13,600 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:13,600 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:13,602 INFO L82 PathProgramCache]: Analyzing trace with hash 885452485, now seen corresponding path program 25 times [2019-09-07 10:14:13,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:13,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:13,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:13,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:13,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-07 10:14:13,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:13,861 INFO L223 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-09-07 10:14:13,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:13,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:14:13,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:13,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:13,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:14:13,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:14:13,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:14:13,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:13,987 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand 23 states. [2019-09-07 10:14:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:14,041 INFO L93 Difference]: Finished difference Result 188 states and 230 transitions. [2019-09-07 10:14:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:14:14,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2019-09-07 10:14:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:14,043 INFO L225 Difference]: With dead ends: 188 [2019-09-07 10:14:14,043 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 10:14:14,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:14:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 10:14:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-07 10:14:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-07 10:14:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2019-09-07 10:14:14,048 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 110 [2019-09-07 10:14:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:14,049 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2019-09-07 10:14:14,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:14:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2019-09-07 10:14:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 10:14:14,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:14,050 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:14,050 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2122006119, now seen corresponding path program 26 times [2019-09-07 10:14:14,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:14,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:14,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:14,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:14,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 10:14:14,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:14,352 INFO L223 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) [2019-09-07 10:14:14,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:14,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:14,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:14,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:14:14,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-07 10:14:14,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:14,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 10:14:14,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:14:14,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:14:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:14:14,874 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 43 states. [2019-09-07 10:14:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:15,093 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2019-09-07 10:14:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:14:15,094 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 112 [2019-09-07 10:14:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:15,095 INFO L225 Difference]: With dead ends: 195 [2019-09-07 10:14:15,095 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 10:14:15,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:14:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 10:14:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-09-07 10:14:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 10:14:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2019-09-07 10:14:15,108 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 112 [2019-09-07 10:14:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:15,108 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2019-09-07 10:14:15,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:14:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2019-09-07 10:14:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 10:14:15,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:15,110 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:15,110 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1102806627, now seen corresponding path program 27 times [2019-09-07 10:14:15,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:15,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:15,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:14:15,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:15,409 INFO L223 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-09-07 10:14:15,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:14:16,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 10:14:16,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:16,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:14:16,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:14:16,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:16,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:14:16,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:14:16,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:14:16,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:14:16,442 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand 24 states. [2019-09-07 10:14:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:16,562 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2019-09-07 10:14:16,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:14:16,563 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2019-09-07 10:14:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:16,564 INFO L225 Difference]: With dead ends: 138 [2019-09-07 10:14:16,565 INFO L226 Difference]: Without dead ends: 127 [2019-09-07 10:14:16,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 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-09-07 10:14:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-07 10:14:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-09-07 10:14:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-07 10:14:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2019-09-07 10:14:16,571 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 117 [2019-09-07 10:14:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:16,571 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2019-09-07 10:14:16,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:14:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2019-09-07 10:14:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 10:14:16,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:16,573 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:16,573 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:16,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:16,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1232815945, now seen corresponding path program 28 times [2019-09-07 10:14:16,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:16,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:16,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:16,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:16,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-07 10:14:16,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:16,932 INFO L223 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-09-07 10:14:16,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:14:17,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:17,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:17,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:14:17,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-07 10:14:17,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:17,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:14:17,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:14:17,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:14:17,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:14:17,058 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 25 states. [2019-09-07 10:14:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:17,119 INFO L93 Difference]: Finished difference Result 204 states and 250 transitions. [2019-09-07 10:14:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:14:17,120 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 120 [2019-09-07 10:14:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:17,121 INFO L225 Difference]: With dead ends: 204 [2019-09-07 10:14:17,121 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 10:14:17,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:14:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 10:14:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-07 10:14:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-07 10:14:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2019-09-07 10:14:17,127 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 120 [2019-09-07 10:14:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:17,127 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2019-09-07 10:14:17,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:14:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2019-09-07 10:14:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 10:14:17,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:17,129 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:17,130 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash -837684117, now seen corresponding path program 29 times [2019-09-07 10:14:17,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:17,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:17,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 10:14:17,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:17,490 INFO L223 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) [2019-09-07 10:14:17,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:18,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 10:14:18,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:18,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:14:18,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-07 10:14:18,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:18,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-09-07 10:14:18,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:14:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:14:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:14:18,733 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand 47 states. [2019-09-07 10:14:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:18,983 INFO L93 Difference]: Finished difference Result 211 states and 260 transitions. [2019-09-07 10:14:18,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:14:18,984 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 122 [2019-09-07 10:14:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:18,985 INFO L225 Difference]: With dead ends: 211 [2019-09-07 10:14:18,985 INFO L226 Difference]: Without dead ends: 135 [2019-09-07 10:14:18,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:14:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-07 10:14:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-09-07 10:14:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-07 10:14:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2019-09-07 10:14:18,996 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 122 [2019-09-07 10:14:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:18,997 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2019-09-07 10:14:18,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:14:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2019-09-07 10:14:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 10:14:18,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:18,999 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:18,999 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:18,999 INFO L82 PathProgramCache]: Analyzing trace with hash -459346849, now seen corresponding path program 30 times [2019-09-07 10:14:19,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:19,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:19,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:19,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 10:14:19,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:19,311 INFO L223 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-09-07 10:14:19,325 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:20,558 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-09-07 10:14:20,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:20,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:14:20,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-07 10:14:21,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:21,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 10:14:21,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:14:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:14:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:14:21,076 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand 49 states. [2019-09-07 10:14:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:21,319 INFO L93 Difference]: Finished difference Result 219 states and 270 transitions. [2019-09-07 10:14:21,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:14:21,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 127 [2019-09-07 10:14:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:21,321 INFO L225 Difference]: With dead ends: 219 [2019-09-07 10:14:21,321 INFO L226 Difference]: Without dead ends: 140 [2019-09-07 10:14:21,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:14:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-07 10:14:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-09-07 10:14:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 10:14:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2019-09-07 10:14:21,325 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 127 [2019-09-07 10:14:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:21,326 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2019-09-07 10:14:21,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:14:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2019-09-07 10:14:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 10:14:21,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:21,327 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:21,327 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1576628847, now seen corresponding path program 31 times [2019-09-07 10:14:21,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:21,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:21,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 10:14:21,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:21,762 INFO L223 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) [2019-09-07 10:14:21,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:21,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:14:21,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-09-07 10:14:22,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:22,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 10:14:22,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:14:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:14:22,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:14:22,441 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand 51 states. [2019-09-07 10:14:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:22,742 INFO L93 Difference]: Finished difference Result 227 states and 280 transitions. [2019-09-07 10:14:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:14:22,742 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 132 [2019-09-07 10:14:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:22,744 INFO L225 Difference]: With dead ends: 227 [2019-09-07 10:14:22,744 INFO L226 Difference]: Without dead ends: 145 [2019-09-07 10:14:22,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:14:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-07 10:14:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-09-07 10:14:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-07 10:14:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 168 transitions. [2019-09-07 10:14:22,753 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 168 transitions. Word has length 132 [2019-09-07 10:14:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:22,754 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 168 transitions. [2019-09-07 10:14:22,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:14:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 168 transitions. [2019-09-07 10:14:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 10:14:22,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:22,756 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:22,756 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1543991899, now seen corresponding path program 32 times [2019-09-07 10:14:22,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:22,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:22,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:22,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:22,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 10:14:23,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:23,225 INFO L223 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) [2019-09-07 10:14:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:23,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:23,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:23,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:14:23,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2019-09-07 10:14:23,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:23,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2019-09-07 10:14:23,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:14:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:14:23,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:14:23,943 INFO L87 Difference]: Start difference. First operand 142 states and 168 transitions. Second operand 53 states. [2019-09-07 10:14:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:24,228 INFO L93 Difference]: Finished difference Result 235 states and 290 transitions. [2019-09-07 10:14:24,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 10:14:24,228 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 137 [2019-09-07 10:14:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:24,230 INFO L225 Difference]: With dead ends: 235 [2019-09-07 10:14:24,230 INFO L226 Difference]: Without dead ends: 150 [2019-09-07 10:14:24,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:14:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-07 10:14:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-09-07 10:14:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-07 10:14:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2019-09-07 10:14:24,237 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 137 [2019-09-07 10:14:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:24,238 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2019-09-07 10:14:24,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:14:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2019-09-07 10:14:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 10:14:24,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:24,239 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:24,239 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash -570034061, now seen corresponding path program 33 times [2019-09-07 10:14:24,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:24,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:24,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 10:14:24,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:24,779 INFO L223 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) [2019-09-07 10:14:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:27,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-07 10:14:27,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:27,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:14:27,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:27,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:27,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:14:27,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:14:27,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:14:27,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:14:27,440 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand 29 states. [2019-09-07 10:14:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:27,573 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2019-09-07 10:14:27,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:14:27,577 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 142 [2019-09-07 10:14:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:27,578 INFO L225 Difference]: With dead ends: 163 [2019-09-07 10:14:27,578 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:14:27,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:14:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:14:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-09-07 10:14:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-07 10:14:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 178 transitions. [2019-09-07 10:14:27,584 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 178 transitions. Word has length 142 [2019-09-07 10:14:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:27,585 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 178 transitions. [2019-09-07 10:14:27,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:14:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2019-09-07 10:14:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-07 10:14:27,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:27,586 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:27,586 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 141415225, now seen corresponding path program 34 times [2019-09-07 10:14:27,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:27,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:27,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2019-09-07 10:14:28,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:28,176 INFO L223 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-09-07 10:14:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:14:28,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:28,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:28,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:14:28,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 10:14:28,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:28,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2019-09-07 10:14:28,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:14:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:14:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:14:28,990 INFO L87 Difference]: Start difference. First operand 150 states and 178 transitions. Second operand 56 states. [2019-09-07 10:14:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:29,251 INFO L93 Difference]: Finished difference Result 249 states and 308 transitions. [2019-09-07 10:14:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:14:29,253 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 145 [2019-09-07 10:14:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:29,254 INFO L225 Difference]: With dead ends: 249 [2019-09-07 10:14:29,254 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 10:14:29,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:14:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 10:14:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2019-09-07 10:14:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-07 10:14:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2019-09-07 10:14:29,263 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 145 [2019-09-07 10:14:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:29,265 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2019-09-07 10:14:29,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:14:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2019-09-07 10:14:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 10:14:29,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:29,267 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:29,268 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1246281515, now seen corresponding path program 35 times [2019-09-07 10:14:29,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:29,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:29,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:29,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:29,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-09-07 10:14:29,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:29,796 INFO L223 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-09-07 10:14:29,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:31,874 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-07 10:14:31,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:31,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:14:31,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-09-07 10:14:31,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:31,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:14:31,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:14:31,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:14:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:14:31,917 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 31 states. [2019-09-07 10:14:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:32,028 INFO L93 Difference]: Finished difference Result 252 states and 310 transitions. [2019-09-07 10:14:32,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:14:32,029 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 150 [2019-09-07 10:14:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:32,031 INFO L225 Difference]: With dead ends: 252 [2019-09-07 10:14:32,031 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 10:14:32,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 150 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-09-07 10:14:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 10:14:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-07 10:14:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-07 10:14:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2019-09-07 10:14:32,037 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 150 [2019-09-07 10:14:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:32,037 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2019-09-07 10:14:32,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:14:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2019-09-07 10:14:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 10:14:32,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:32,039 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:32,039 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:32,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1509177737, now seen corresponding path program 36 times [2019-09-07 10:14:32,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:32,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:32,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:32,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 10:14:32,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:32,473 INFO L223 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-09-07 10:14:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:14:35,948 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-09-07 10:14:35,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:35,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:14:35,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-09-07 10:14:36,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:36,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2019-09-07 10:14:36,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:14:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:14:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:14:36,649 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand 59 states. [2019-09-07 10:14:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:36,959 INFO L93 Difference]: Finished difference Result 259 states and 320 transitions. [2019-09-07 10:14:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:14:36,959 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 152 [2019-09-07 10:14:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:36,961 INFO L225 Difference]: With dead ends: 259 [2019-09-07 10:14:36,961 INFO L226 Difference]: Without dead ends: 165 [2019-09-07 10:14:36,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:14:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-07 10:14:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-09-07 10:14:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-07 10:14:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-09-07 10:14:36,970 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 152 [2019-09-07 10:14:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:36,970 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-09-07 10:14:36,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:14:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-09-07 10:14:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-07 10:14:36,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:36,972 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:36,973 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash 286705235, now seen corresponding path program 37 times [2019-09-07 10:14:36,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:36,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:36,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:36,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:36,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 10:14:37,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:37,419 INFO L223 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-09-07 10:14:37,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:37,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:14:37,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:38,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 10:14:38,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 10:14:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 10:14:38,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:14:38,225 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 61 states. [2019-09-07 10:14:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:38,543 INFO L93 Difference]: Finished difference Result 267 states and 330 transitions. [2019-09-07 10:14:38,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 10:14:38,543 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 157 [2019-09-07 10:14:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:38,545 INFO L225 Difference]: With dead ends: 267 [2019-09-07 10:14:38,545 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 10:14:38,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:14:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 10:14:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-09-07 10:14:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-07 10:14:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2019-09-07 10:14:38,552 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 157 [2019-09-07 10:14:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:38,552 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2019-09-07 10:14:38,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 10:14:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2019-09-07 10:14:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-07 10:14:38,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:38,554 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:38,554 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash 970923131, now seen corresponding path program 38 times [2019-09-07 10:14:38,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:38,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:38,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:38,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 10:14:38,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:38,987 INFO L223 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-09-07 10:14:38,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:14:39,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:14:39,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:39,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:14:39,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2019-09-07 10:14:39,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:39,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-09-07 10:14:39,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:14:39,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:14:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:14:39,867 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand 63 states. [2019-09-07 10:14:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:40,214 INFO L93 Difference]: Finished difference Result 275 states and 340 transitions. [2019-09-07 10:14:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:14:40,214 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 162 [2019-09-07 10:14:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:40,215 INFO L225 Difference]: With dead ends: 275 [2019-09-07 10:14:40,215 INFO L226 Difference]: Without dead ends: 175 [2019-09-07 10:14:40,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:14:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-07 10:14:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-09-07 10:14:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-07 10:14:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 204 transitions. [2019-09-07 10:14:40,223 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 204 transitions. Word has length 162 [2019-09-07 10:14:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:40,223 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 204 transitions. [2019-09-07 10:14:40,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:14:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2019-09-07 10:14:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 10:14:40,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:40,225 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:40,225 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash -434826161, now seen corresponding path program 39 times [2019-09-07 10:14:40,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:40,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:40,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2296 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 10:14:40,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:40,797 INFO L223 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) [2019-09-07 10:14:40,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:47,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-09-07 10:14:47,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:47,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:14:47,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2296 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 10:14:47,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:47,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:14:47,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:14:47,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:14:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:14:47,347 INFO L87 Difference]: Start difference. First operand 172 states and 204 transitions. Second operand 34 states. [2019-09-07 10:14:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:47,476 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2019-09-07 10:14:47,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:14:47,479 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 167 [2019-09-07 10:14:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:47,481 INFO L225 Difference]: With dead ends: 188 [2019-09-07 10:14:47,481 INFO L226 Difference]: Without dead ends: 177 [2019-09-07 10:14:47,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 167 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-09-07 10:14:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-07 10:14:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-09-07 10:14:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 10:14:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 208 transitions. [2019-09-07 10:14:47,488 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 208 transitions. Word has length 167 [2019-09-07 10:14:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:47,489 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 208 transitions. [2019-09-07 10:14:47,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:14:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 208 transitions. [2019-09-07 10:14:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 10:14:47,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:47,490 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:47,490 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash -559359523, now seen corresponding path program 40 times [2019-09-07 10:14:47,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:47,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:47,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:47,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:47,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2019-09-07 10:14:48,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:48,156 INFO L223 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) [2019-09-07 10:14:48,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:48,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:14:48,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:48,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:14:48,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:14:48,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:48,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:14:48,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:14:48,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:14:48,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:48,287 INFO L87 Difference]: Start difference. First operand 175 states and 208 transitions. Second operand 35 states. [2019-09-07 10:14:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:48,400 INFO L93 Difference]: Finished difference Result 284 states and 350 transitions. [2019-09-07 10:14:48,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:14:48,402 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 170 [2019-09-07 10:14:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:48,403 INFO L225 Difference]: With dead ends: 284 [2019-09-07 10:14:48,403 INFO L226 Difference]: Without dead ends: 178 [2019-09-07 10:14:48,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-07 10:14:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-07 10:14:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 10:14:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2019-09-07 10:14:48,410 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 170 [2019-09-07 10:14:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:48,410 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2019-09-07 10:14:48,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:14:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2019-09-07 10:14:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 10:14:48,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:48,412 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:48,412 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash -850118017, now seen corresponding path program 41 times [2019-09-07 10:14:48,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:48,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:48,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:48,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:48,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 10:14:48,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:48,960 INFO L223 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-09-07 10:14:48,972 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:14:50,875 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-09-07 10:14:50,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:50,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:14:50,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 10:14:50,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:14:50,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:14:50,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:14:50,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:50,947 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand 35 states. [2019-09-07 10:14:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:51,122 INFO L93 Difference]: Finished difference Result 193 states and 229 transitions. [2019-09-07 10:14:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:14:51,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-09-07 10:14:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:51,127 INFO L225 Difference]: With dead ends: 193 [2019-09-07 10:14:51,127 INFO L226 Difference]: Without dead ends: 182 [2019-09-07 10:14:51,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:14:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-07 10:14:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-09-07 10:14:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-07 10:14:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2019-09-07 10:14:51,135 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 172 [2019-09-07 10:14:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:51,135 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2019-09-07 10:14:51,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:14:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2019-09-07 10:14:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-07 10:14:51,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:51,137 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:51,137 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:51,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:51,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1281738157, now seen corresponding path program 42 times [2019-09-07 10:14:51,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:51,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:51,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-09-07 10:14:51,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:51,942 INFO L223 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) [2019-09-07 10:14:51,957 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:57,553 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-09-07 10:14:57,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:57,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:14:57,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-09-07 10:14:57,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:57,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:14:57,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:14:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:14:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:14:57,602 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand 36 states. [2019-09-07 10:14:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:57,732 INFO L93 Difference]: Finished difference Result 292 states and 360 transitions. [2019-09-07 10:14:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:14:57,732 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 175 [2019-09-07 10:14:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:57,734 INFO L225 Difference]: With dead ends: 292 [2019-09-07 10:14:57,734 INFO L226 Difference]: Without dead ends: 183 [2019-09-07 10:14:57,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:14:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-07 10:14:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-07 10:14:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 10:14:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2019-09-07 10:14:57,740 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 175 [2019-09-07 10:14:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:57,740 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2019-09-07 10:14:57,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:14:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2019-09-07 10:14:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-07 10:14:57,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:57,741 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:57,742 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1236829621, now seen corresponding path program 43 times [2019-09-07 10:14:57,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:57,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:57,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-07 10:14:58,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:58,315 INFO L223 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-09-07 10:14:58,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:58,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:14:58,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-09-07 10:14:59,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:59,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 10:14:59,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 10:14:59,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 10:14:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:14:59,517 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand 69 states. [2019-09-07 10:14:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:59,858 INFO L93 Difference]: Finished difference Result 299 states and 370 transitions. [2019-09-07 10:14:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 10:14:59,859 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 177 [2019-09-07 10:14:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:59,860 INFO L225 Difference]: With dead ends: 299 [2019-09-07 10:14:59,860 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 10:14:59,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:14:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 10:14:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-09-07 10:14:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-07 10:14:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 222 transitions. [2019-09-07 10:14:59,866 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 222 transitions. Word has length 177 [2019-09-07 10:14:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:59,867 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 222 transitions. [2019-09-07 10:14:59,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 10:14:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 222 transitions. [2019-09-07 10:14:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 10:14:59,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:59,868 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:14:59,868 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash -935370621, now seen corresponding path program 44 times [2019-09-07 10:14:59,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:59,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:59,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:14:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2773 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 10:15:00,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:00,416 INFO L223 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-09-07 10:15:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:15:00,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:00,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:00,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:15:00,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2773 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-07 10:15:01,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:01,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 71 [2019-09-07 10:15:01,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 10:15:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 10:15:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:15:01,451 INFO L87 Difference]: Start difference. First operand 187 states and 222 transitions. Second operand 71 states. [2019-09-07 10:15:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:01,815 INFO L93 Difference]: Finished difference Result 307 states and 380 transitions. [2019-09-07 10:15:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 10:15:01,815 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 182 [2019-09-07 10:15:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:01,816 INFO L225 Difference]: With dead ends: 307 [2019-09-07 10:15:01,817 INFO L226 Difference]: Without dead ends: 195 [2019-09-07 10:15:01,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:15:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-07 10:15:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-09-07 10:15:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-07 10:15:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 228 transitions. [2019-09-07 10:15:01,824 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 228 transitions. Word has length 182 [2019-09-07 10:15:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:01,825 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 228 transitions. [2019-09-07 10:15:01,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 10:15:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 228 transitions. [2019-09-07 10:15:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 10:15:01,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:01,826 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:01,826 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash -296110009, now seen corresponding path program 45 times [2019-09-07 10:15:01,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:01,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:01,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2942 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 10:15:02,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:02,500 INFO L223 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-09-07 10:15:02,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:14,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-07 10:15:14,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:14,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:15:14,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2942 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 10:15:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:15:14,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:15:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:15:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:15:14,965 INFO L87 Difference]: Start difference. First operand 192 states and 228 transitions. Second operand 38 states. [2019-09-07 10:15:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:15,211 INFO L93 Difference]: Finished difference Result 208 states and 247 transitions. [2019-09-07 10:15:15,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:15:15,212 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 187 [2019-09-07 10:15:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:15,214 INFO L225 Difference]: With dead ends: 208 [2019-09-07 10:15:15,214 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 10:15:15,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 187 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-09-07 10:15:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 10:15:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-09-07 10:15:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-07 10:15:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2019-09-07 10:15:15,222 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 187 [2019-09-07 10:15:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:15,222 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2019-09-07 10:15:15,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:15:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2019-09-07 10:15:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 10:15:15,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:15,224 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:15,224 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 174985957, now seen corresponding path program 46 times [2019-09-07 10:15:15,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:15,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:15,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:15,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:15,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2019-09-07 10:15:16,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:16,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:16,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:16,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:16,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:16,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:15:16,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2019-09-07 10:15:16,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:16,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-07 10:15:16,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:15:16,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:15:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:15:16,401 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 39 states. [2019-09-07 10:15:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:16,527 INFO L93 Difference]: Finished difference Result 316 states and 390 transitions. [2019-09-07 10:15:16,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 10:15:16,527 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 190 [2019-09-07 10:15:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:16,529 INFO L225 Difference]: With dead ends: 316 [2019-09-07 10:15:16,529 INFO L226 Difference]: Without dead ends: 198 [2019-09-07 10:15:16,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:15:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-07 10:15:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-07 10:15:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-07 10:15:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 234 transitions. [2019-09-07 10:15:16,535 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 234 transitions. Word has length 190 [2019-09-07 10:15:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:16,535 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 234 transitions. [2019-09-07 10:15:16,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:15:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 234 transitions. [2019-09-07 10:15:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 10:15:16,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:16,537 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:16,537 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1249169031, now seen corresponding path program 47 times [2019-09-07 10:15:16,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:16,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:16,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3116 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-07 10:15:17,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:17,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:19,790 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-07 10:15:19,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:19,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:15:19,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3116 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-07 10:15:19,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:19,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-07 10:15:19,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:15:19,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:15:19,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:15:19,859 INFO L87 Difference]: Start difference. First operand 197 states and 234 transitions. Second operand 39 states. [2019-09-07 10:15:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:20,047 INFO L93 Difference]: Finished difference Result 213 states and 253 transitions. [2019-09-07 10:15:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 10:15:20,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 192 [2019-09-07 10:15:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:20,049 INFO L225 Difference]: With dead ends: 213 [2019-09-07 10:15:20,049 INFO L226 Difference]: Without dead ends: 202 [2019-09-07 10:15:20,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:15:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-07 10:15:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-09-07 10:15:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-07 10:15:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 238 transitions. [2019-09-07 10:15:20,056 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 238 transitions. Word has length 192 [2019-09-07 10:15:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:20,056 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 238 transitions. [2019-09-07 10:15:20,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:15:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 238 transitions. [2019-09-07 10:15:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-07 10:15:20,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:20,058 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:20,058 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2123388069, now seen corresponding path program 48 times [2019-09-07 10:15:20,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:20,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:20,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:20,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:20,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-09-07 10:15:20,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:20,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:20,700 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:29,228 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 10:15:29,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:29,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:15:29,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-09-07 10:15:30,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:30,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 76 [2019-09-07 10:15:30,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-07 10:15:30,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-07 10:15:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 10:15:30,369 INFO L87 Difference]: Start difference. First operand 200 states and 238 transitions. Second operand 76 states. [2019-09-07 10:15:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:30,736 INFO L93 Difference]: Finished difference Result 329 states and 408 transitions. [2019-09-07 10:15:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 10:15:30,739 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 195 [2019-09-07 10:15:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:30,741 INFO L225 Difference]: With dead ends: 329 [2019-09-07 10:15:30,741 INFO L226 Difference]: Without dead ends: 208 [2019-09-07 10:15:30,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 10:15:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-07 10:15:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2019-09-07 10:15:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 10:15:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2019-09-07 10:15:30,746 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 195 [2019-09-07 10:15:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:30,747 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2019-09-07 10:15:30,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-07 10:15:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2019-09-07 10:15:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-07 10:15:30,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:30,748 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:30,749 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:30,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash -134829207, now seen corresponding path program 49 times [2019-09-07 10:15:30,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:30,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:30,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:30,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:30,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2019-09-07 10:15:31,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:31,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:31,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:15:31,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2019-09-07 10:15:31,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:31,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:15:31,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:15:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:15:31,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:15:31,559 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand 41 states. [2019-09-07 10:15:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:31,688 INFO L93 Difference]: Finished difference Result 332 states and 410 transitions. [2019-09-07 10:15:31,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:15:31,689 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-09-07 10:15:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:31,690 INFO L225 Difference]: With dead ends: 332 [2019-09-07 10:15:31,691 INFO L226 Difference]: Without dead ends: 208 [2019-09-07 10:15:31,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:15:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-07 10:15:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-07 10:15:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-07 10:15:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2019-09-07 10:15:31,697 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 200 [2019-09-07 10:15:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:31,697 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2019-09-07 10:15:31,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:15:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2019-09-07 10:15:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 10:15:31,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:31,699 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:31,699 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1345796981, now seen corresponding path program 50 times [2019-09-07 10:15:31,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:31,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:31,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:31,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:31,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3479 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2019-09-07 10:15:32,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:32,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:15:32,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:32,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:32,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:15:32,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3479 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2019-09-07 10:15:33,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 79 [2019-09-07 10:15:33,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-07 10:15:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-07 10:15:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 10:15:33,615 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 79 states. [2019-09-07 10:15:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:34,044 INFO L93 Difference]: Finished difference Result 339 states and 420 transitions. [2019-09-07 10:15:34,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 10:15:34,045 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 202 [2019-09-07 10:15:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:34,046 INFO L225 Difference]: With dead ends: 339 [2019-09-07 10:15:34,046 INFO L226 Difference]: Without dead ends: 215 [2019-09-07 10:15:34,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 10:15:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-07 10:15:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-09-07 10:15:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 10:15:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2019-09-07 10:15:34,052 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 202 [2019-09-07 10:15:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:34,052 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2019-09-07 10:15:34,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-07 10:15:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2019-09-07 10:15:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 10:15:34,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:34,053 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:34,054 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1657584703, now seen corresponding path program 51 times [2019-09-07 10:15:34,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:34,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:34,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3668 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-07 10:15:34,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:34,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:34,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:55,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-07 10:15:55,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:55,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:15:55,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3668 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-09-07 10:15:55,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:55,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-07 10:15:55,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 10:15:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 10:15:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:15:55,818 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 42 states. [2019-09-07 10:15:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:55,999 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2019-09-07 10:15:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 10:15:56,000 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 207 [2019-09-07 10:15:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:56,001 INFO L225 Difference]: With dead ends: 228 [2019-09-07 10:15:56,001 INFO L226 Difference]: Without dead ends: 217 [2019-09-07 10:15:56,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:15:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-07 10:15:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-09-07 10:15:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-07 10:15:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 256 transitions. [2019-09-07 10:15:56,006 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 256 transitions. Word has length 207 [2019-09-07 10:15:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:56,006 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 256 transitions. [2019-09-07 10:15:56,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 10:15:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 256 transitions. [2019-09-07 10:15:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 10:15:56,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:56,008 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:56,008 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1592323053, now seen corresponding path program 52 times [2019-09-07 10:15:56,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:56,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:56,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-07 10:15:56,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:56,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:15:56,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:56,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:56,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:15:56,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-07 10:15:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:56,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 10:15:56,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:15:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:15:56,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:15:56,876 INFO L87 Difference]: Start difference. First operand 215 states and 256 transitions. Second operand 43 states. [2019-09-07 10:15:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:57,018 INFO L93 Difference]: Finished difference Result 348 states and 430 transitions. [2019-09-07 10:15:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 10:15:57,019 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 210 [2019-09-07 10:15:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:57,020 INFO L225 Difference]: With dead ends: 348 [2019-09-07 10:15:57,020 INFO L226 Difference]: Without dead ends: 218 [2019-09-07 10:15:57,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:15:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-07 10:15:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-07 10:15:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-07 10:15:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 258 transitions. [2019-09-07 10:15:57,027 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 258 transitions. Word has length 210 [2019-09-07 10:15:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:57,028 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 258 transitions. [2019-09-07 10:15:57,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:15:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 258 transitions. [2019-09-07 10:15:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-07 10:15:57,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:57,029 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:57,029 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 336560783, now seen corresponding path program 53 times [2019-09-07 10:15:57,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:57,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3862 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-07 10:15:58,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:58,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:58,016 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:16:03,549 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-09-07 10:16:03,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:03,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:16:03,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3862 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-09-07 10:16:04,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:04,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43] total 83 [2019-09-07 10:16:04,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-07 10:16:04,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-07 10:16:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:16:04,887 INFO L87 Difference]: Start difference. First operand 217 states and 258 transitions. Second operand 83 states. [2019-09-07 10:16:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:05,357 INFO L93 Difference]: Finished difference Result 355 states and 440 transitions. [2019-09-07 10:16:05,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 10:16:05,358 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 212 [2019-09-07 10:16:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:05,359 INFO L225 Difference]: With dead ends: 355 [2019-09-07 10:16:05,359 INFO L226 Difference]: Without dead ends: 225 [2019-09-07 10:16:05,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:16:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-07 10:16:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-09-07 10:16:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-07 10:16:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 264 transitions. [2019-09-07 10:16:05,365 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 264 transitions. Word has length 212 [2019-09-07 10:16:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:05,365 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 264 transitions. [2019-09-07 10:16:05,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-07 10:16:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 264 transitions. [2019-09-07 10:16:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 10:16:05,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:05,367 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:05,367 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash 109380155, now seen corresponding path program 54 times [2019-09-07 10:16:05,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:05,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:05,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4061 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-07 10:16:06,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:06,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:06,167 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:16:20,816 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2019-09-07 10:16:20,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:20,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:16:20,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4061 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-07 10:16:22,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:22,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 85 [2019-09-07 10:16:22,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-07 10:16:22,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-07 10:16:22,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 10:16:22,147 INFO L87 Difference]: Start difference. First operand 222 states and 264 transitions. Second operand 85 states. [2019-09-07 10:16:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:22,687 INFO L93 Difference]: Finished difference Result 363 states and 450 transitions. [2019-09-07 10:16:22,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-07 10:16:22,687 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 217 [2019-09-07 10:16:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:22,688 INFO L225 Difference]: With dead ends: 363 [2019-09-07 10:16:22,688 INFO L226 Difference]: Without dead ends: 230 [2019-09-07 10:16:22,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 10:16:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-07 10:16:22,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-09-07 10:16:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-07 10:16:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2019-09-07 10:16:22,694 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 217 [2019-09-07 10:16:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:22,694 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2019-09-07 10:16:22,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-07 10:16:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2019-09-07 10:16:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 10:16:22,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:22,696 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:22,696 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:22,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:22,697 INFO L82 PathProgramCache]: Analyzing trace with hash -685946733, now seen corresponding path program 55 times [2019-09-07 10:16:22,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:22,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:22,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4265 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-07 10:16:23,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:23,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:23,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:16:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:24,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:16:24,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4265 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 2501 trivial. 0 not checked. [2019-09-07 10:16:25,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:25,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45] total 87 [2019-09-07 10:16:25,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-07 10:16:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-07 10:16:25,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 10:16:25,545 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 87 states. [2019-09-07 10:16:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:26,056 INFO L93 Difference]: Finished difference Result 371 states and 460 transitions. [2019-09-07 10:16:26,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 10:16:26,056 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 222 [2019-09-07 10:16:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:26,058 INFO L225 Difference]: With dead ends: 371 [2019-09-07 10:16:26,058 INFO L226 Difference]: Without dead ends: 235 [2019-09-07 10:16:26,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 10:16:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-07 10:16:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-09-07 10:16:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 10:16:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2019-09-07 10:16:26,064 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 222 [2019-09-07 10:16:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:26,065 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2019-09-07 10:16:26,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-07 10:16:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2019-09-07 10:16:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-07 10:16:26,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:26,066 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:26,066 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash -657711049, now seen corresponding path program 56 times [2019-09-07 10:16:26,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:26,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:26,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:26,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:16:26,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-07 10:16:26,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:26,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:26,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:16:26,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:16:26,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:16:26,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:16:26,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:16:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2625 trivial. 0 not checked. [2019-09-07 10:16:28,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:16:28,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 89 [2019-09-07 10:16:28,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-07 10:16:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-07 10:16:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:16:28,910 INFO L87 Difference]: Start difference. First operand 232 states and 276 transitions. Second operand 89 states. [2019-09-07 10:16:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:16:29,424 INFO L93 Difference]: Finished difference Result 379 states and 470 transitions. [2019-09-07 10:16:29,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-07 10:16:29,424 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 227 [2019-09-07 10:16:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:16:29,425 INFO L225 Difference]: With dead ends: 379 [2019-09-07 10:16:29,425 INFO L226 Difference]: Without dead ends: 240 [2019-09-07 10:16:29,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 10:16:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-07 10:16:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2019-09-07 10:16:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-07 10:16:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 282 transitions. [2019-09-07 10:16:29,433 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 282 transitions. Word has length 227 [2019-09-07 10:16:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:16:29,433 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 282 transitions. [2019-09-07 10:16:29,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-07 10:16:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 282 transitions. [2019-09-07 10:16:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 10:16:29,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:16:29,435 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:16:29,435 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:16:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:16:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash 549869207, now seen corresponding path program 57 times [2019-09-07 10:16:29,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:16:29,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:16:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:29,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:16:29,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:16:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:16:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4688 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-07 10:16:30,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:16:30,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:16:30,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:17:07,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-07 10:17:07,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:07,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:17:07,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4688 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-07 10:17:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:07,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 10:17:07,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:17:07,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:17:07,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:17:07,830 INFO L87 Difference]: Start difference. First operand 237 states and 282 transitions. Second operand 47 states. [2019-09-07 10:17:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:08,133 INFO L93 Difference]: Finished difference Result 253 states and 301 transitions. [2019-09-07 10:17:08,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:17:08,133 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 232 [2019-09-07 10:17:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:08,136 INFO L225 Difference]: With dead ends: 253 [2019-09-07 10:17:08,136 INFO L226 Difference]: Without dead ends: 242 [2019-09-07 10:17:08,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:17:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-07 10:17:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-07 10:17:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 10:17:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 286 transitions. [2019-09-07 10:17:08,144 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 286 transitions. Word has length 232 [2019-09-07 10:17:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:08,145 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 286 transitions. [2019-09-07 10:17:08,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:17:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 286 transitions. [2019-09-07 10:17:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 10:17:08,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:08,148 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:08,149 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:08,149 INFO L82 PathProgramCache]: Analyzing trace with hash -126283115, now seen corresponding path program 58 times [2019-09-07 10:17:08,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:08,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:08,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2019-09-07 10:17:09,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:09,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:09,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:17:09,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:17:09,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:09,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:17:09,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2019-09-07 10:17:09,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:09,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-07 10:17:09,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 10:17:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 10:17:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:17:09,435 INFO L87 Difference]: Start difference. First operand 240 states and 286 transitions. Second operand 48 states. [2019-09-07 10:17:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:09,638 INFO L93 Difference]: Finished difference Result 388 states and 480 transitions. [2019-09-07 10:17:09,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:17:09,639 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 235 [2019-09-07 10:17:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:09,640 INFO L225 Difference]: With dead ends: 388 [2019-09-07 10:17:09,641 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 10:17:09,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:17:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 10:17:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-09-07 10:17:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 10:17:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 288 transitions. [2019-09-07 10:17:09,649 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 288 transitions. Word has length 235 [2019-09-07 10:17:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:09,649 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 288 transitions. [2019-09-07 10:17:09,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 10:17:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 288 transitions. [2019-09-07 10:17:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-07 10:17:09,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:09,652 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:09,652 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:09,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1135749581, now seen corresponding path program 59 times [2019-09-07 10:17:09,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:09,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:09,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:09,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:09,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4907 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-07 10:17:10,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:10,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:17:26,979 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-07 10:17:26,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:26,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:17:26,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4907 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-07 10:17:27,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:27,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-07 10:17:27,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 10:17:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 10:17:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:17:27,044 INFO L87 Difference]: Start difference. First operand 242 states and 288 transitions. Second operand 48 states. [2019-09-07 10:17:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:27,332 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2019-09-07 10:17:27,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:17:27,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 237 [2019-09-07 10:17:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:27,334 INFO L225 Difference]: With dead ends: 258 [2019-09-07 10:17:27,334 INFO L226 Difference]: Without dead ends: 247 [2019-09-07 10:17:27,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:17:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-07 10:17:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-09-07 10:17:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-07 10:17:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 292 transitions. [2019-09-07 10:17:27,338 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 292 transitions. Word has length 237 [2019-09-07 10:17:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:27,338 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 292 transitions. [2019-09-07 10:17:27,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 10:17:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 292 transitions. [2019-09-07 10:17:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 10:17:27,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:27,340 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:17:27,340 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash 362028409, now seen corresponding path program 60 times [2019-09-07 10:17:27,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:27,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:27,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:27,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:27,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2019-09-07 10:17:28,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:28,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:28,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:18:15,732 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-07 10:18:15,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:15,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:18:15,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2019-09-07 10:18:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:15,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 10:18:15,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:18:15,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:18:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:18:15,820 INFO L87 Difference]: Start difference. First operand 245 states and 292 transitions. Second operand 49 states. [2019-09-07 10:18:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:15,973 INFO L93 Difference]: Finished difference Result 396 states and 490 transitions. [2019-09-07 10:18:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:18:15,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 240 [2019-09-07 10:18:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:15,976 INFO L225 Difference]: With dead ends: 396 [2019-09-07 10:18:15,976 INFO L226 Difference]: Without dead ends: 248 [2019-09-07 10:18:15,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:18:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-07 10:18:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-09-07 10:18:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-07 10:18:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 294 transitions. [2019-09-07 10:18:15,982 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 294 transitions. Word has length 240 [2019-09-07 10:18:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:15,982 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 294 transitions. [2019-09-07 10:18:15,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:18:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 294 transitions. [2019-09-07 10:18:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-07 10:18:15,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:15,984 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:15,984 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1692331163, now seen corresponding path program 61 times [2019-09-07 10:18:15,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:15,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:15,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:18:15,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2019-09-07 10:18:16,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:16,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:16,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:18:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:16,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:18:16,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2019-09-07 10:18:18,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:18,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49] total 95 [2019-09-07 10:18:18,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-07 10:18:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-07 10:18:18,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 10:18:18,722 INFO L87 Difference]: Start difference. First operand 247 states and 294 transitions. Second operand 95 states. [2019-09-07 10:18:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:19,257 INFO L93 Difference]: Finished difference Result 403 states and 500 transitions. [2019-09-07 10:18:19,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-07 10:18:19,257 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 242 [2019-09-07 10:18:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:19,259 INFO L225 Difference]: With dead ends: 403 [2019-09-07 10:18:19,260 INFO L226 Difference]: Without dead ends: 255 [2019-09-07 10:18:19,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 10:18:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-07 10:18:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-09-07 10:18:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-07 10:18:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 300 transitions. [2019-09-07 10:18:19,266 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 300 transitions. Word has length 242 [2019-09-07 10:18:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:19,267 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 300 transitions. [2019-09-07 10:18:19,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-07 10:18:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 300 transitions. [2019-09-07 10:18:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-07 10:18:19,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:19,269 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:19,269 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:19,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2051677137, now seen corresponding path program 62 times [2019-09-07 10:18:19,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:19,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:19,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:19,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:18:19,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5360 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-09-07 10:18:20,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:20,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:20,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:18:20,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:18:20,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:18:20,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:18:20,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:18:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5360 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2019-09-07 10:18:22,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:18:22,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 97 [2019-09-07 10:18:22,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-07 10:18:22,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-07 10:18:22,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-09-07 10:18:22,117 INFO L87 Difference]: Start difference. First operand 252 states and 300 transitions. Second operand 97 states. [2019-09-07 10:18:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:18:22,629 INFO L93 Difference]: Finished difference Result 411 states and 510 transitions. [2019-09-07 10:18:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-07 10:18:22,633 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 247 [2019-09-07 10:18:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:18:22,635 INFO L225 Difference]: With dead ends: 411 [2019-09-07 10:18:22,635 INFO L226 Difference]: Without dead ends: 260 [2019-09-07 10:18:22,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-09-07 10:18:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-07 10:18:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2019-09-07 10:18:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-07 10:18:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2019-09-07 10:18:22,641 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 247 [2019-09-07 10:18:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:18:22,642 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2019-09-07 10:18:22,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-07 10:18:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2019-09-07 10:18:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-07 10:18:22,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:18:22,644 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:18:22,644 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:18:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:18:22,644 INFO L82 PathProgramCache]: Analyzing trace with hash -415544673, now seen corresponding path program 63 times [2019-09-07 10:18:22,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:18:22,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:18:22,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:22,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:18:22,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:18:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:18:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5594 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-07 10:18:23,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:18:23,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:18:23,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:19:15,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-07 10:19:15,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:15,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:19:15,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5594 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-07 10:19:15,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:15,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-07 10:19:15,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:19:15,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:19:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:19:15,825 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand 51 states. [2019-09-07 10:19:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:16,091 INFO L93 Difference]: Finished difference Result 273 states and 325 transitions. [2019-09-07 10:19:16,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 10:19:16,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 252 [2019-09-07 10:19:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:16,093 INFO L225 Difference]: With dead ends: 273 [2019-09-07 10:19:16,093 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 10:19:16,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:19:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 10:19:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-07 10:19:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-07 10:19:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 310 transitions. [2019-09-07 10:19:16,100 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 310 transitions. Word has length 252 [2019-09-07 10:19:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:16,100 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 310 transitions. [2019-09-07 10:19:16,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:19:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 310 transitions. [2019-09-07 10:19:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-07 10:19:16,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:16,102 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:16,102 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1670168179, now seen corresponding path program 64 times [2019-09-07 10:19:16,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:16,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:16,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3432 trivial. 0 not checked. [2019-09-07 10:19:17,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:17,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:17,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:19:17,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:19:17,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:17,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:19:17,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3432 trivial. 0 not checked. [2019-09-07 10:19:17,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:17,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-07 10:19:17,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:19:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:19:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:19:17,248 INFO L87 Difference]: Start difference. First operand 260 states and 310 transitions. Second operand 52 states. [2019-09-07 10:19:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:17,438 INFO L93 Difference]: Finished difference Result 420 states and 520 transitions. [2019-09-07 10:19:17,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:19:17,438 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 255 [2019-09-07 10:19:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:17,439 INFO L225 Difference]: With dead ends: 420 [2019-09-07 10:19:17,440 INFO L226 Difference]: Without dead ends: 263 [2019-09-07 10:19:17,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:19:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-07 10:19:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-09-07 10:19:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-07 10:19:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 312 transitions. [2019-09-07 10:19:17,446 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 312 transitions. Word has length 255 [2019-09-07 10:19:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:17,446 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 312 transitions. [2019-09-07 10:19:17,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:19:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 312 transitions. [2019-09-07 10:19:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-07 10:19:17,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:17,448 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:17,448 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2008025643, now seen corresponding path program 65 times [2019-09-07 10:19:17,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:17,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:17,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5833 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2019-09-07 10:19:18,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:18,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:18,530 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:19:41,681 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-09-07 10:19:41,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:41,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:19:41,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5833 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 3432 trivial. 0 not checked. [2019-09-07 10:19:43,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:43,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52] total 101 [2019-09-07 10:19:43,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-07 10:19:43,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-07 10:19:43,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-09-07 10:19:43,591 INFO L87 Difference]: Start difference. First operand 262 states and 312 transitions. Second operand 101 states. [2019-09-07 10:19:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:44,250 INFO L93 Difference]: Finished difference Result 427 states and 530 transitions. [2019-09-07 10:19:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-07 10:19:44,251 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 257 [2019-09-07 10:19:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:44,252 INFO L225 Difference]: With dead ends: 427 [2019-09-07 10:19:44,252 INFO L226 Difference]: Without dead ends: 270 [2019-09-07 10:19:44,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2400 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-09-07 10:19:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-07 10:19:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-09-07 10:19:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-07 10:19:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 318 transitions. [2019-09-07 10:19:44,258 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 318 transitions. Word has length 257 [2019-09-07 10:19:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:44,258 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 318 transitions. [2019-09-07 10:19:44,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-07 10:19:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 318 transitions. [2019-09-07 10:19:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-07 10:19:44,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:44,260 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:19:44,260 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1068478627, now seen corresponding path program 66 times [2019-09-07 10:19:44,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:44,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:44,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:44,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:44,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6077 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2019-09-07 10:19:45,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:45,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:19:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:22:12,022 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2019-09-07 10:22:12,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:12,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:22:12,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6077 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2019-09-07 10:22:14,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:14,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 53] total 103 [2019-09-07 10:22:14,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-07 10:22:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-07 10:22:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 10:22:14,007 INFO L87 Difference]: Start difference. First operand 267 states and 318 transitions. Second operand 103 states. [2019-09-07 10:22:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:14,567 INFO L93 Difference]: Finished difference Result 435 states and 540 transitions. [2019-09-07 10:22:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-07 10:22:14,571 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 262 [2019-09-07 10:22:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:14,572 INFO L225 Difference]: With dead ends: 435 [2019-09-07 10:22:14,572 INFO L226 Difference]: Without dead ends: 275 [2019-09-07 10:22:14,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 10:22:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-07 10:22:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-09-07 10:22:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-07 10:22:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 324 transitions. [2019-09-07 10:22:14,578 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 324 transitions. Word has length 262 [2019-09-07 10:22:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:14,578 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 324 transitions. [2019-09-07 10:22:14,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-07 10:22:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 324 transitions. [2019-09-07 10:22:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-07 10:22:14,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:14,580 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:14,580 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1092089817, now seen corresponding path program 67 times [2019-09-07 10:22:14,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:14,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:14,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:14,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:14,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6326 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-07 10:22:15,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:15,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:15,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:22:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:15,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 10:22:15,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6326 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2019-09-07 10:22:17,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:17,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 54] total 105 [2019-09-07 10:22:17,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-07 10:22:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-07 10:22:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-09-07 10:22:17,824 INFO L87 Difference]: Start difference. First operand 272 states and 324 transitions. Second operand 105 states. [2019-09-07 10:22:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:18,455 INFO L93 Difference]: Finished difference Result 443 states and 550 transitions. [2019-09-07 10:22:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-07 10:22:18,456 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 267 [2019-09-07 10:22:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:18,457 INFO L225 Difference]: With dead ends: 443 [2019-09-07 10:22:18,457 INFO L226 Difference]: Without dead ends: 280 [2019-09-07 10:22:18,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-09-07 10:22:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-07 10:22:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2019-09-07 10:22:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-07 10:22:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2019-09-07 10:22:18,461 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 267 [2019-09-07 10:22:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:18,462 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2019-09-07 10:22:18,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-07 10:22:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2019-09-07 10:22:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-07 10:22:18,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:18,463 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:18,463 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash -569352537, now seen corresponding path program 68 times [2019-09-07 10:22:18,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:18,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:22:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2019-09-07 10:22:19,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:19,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:19,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:22:19,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:22:19,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:19,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:22:19,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 3876 trivial. 0 not checked. [2019-09-07 10:22:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:21,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 55] total 107 [2019-09-07 10:22:21,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-07 10:22:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-07 10:22:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-09-07 10:22:21,855 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand 107 states. [2019-09-07 10:22:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:22,515 INFO L93 Difference]: Finished difference Result 451 states and 560 transitions. [2019-09-07 10:22:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 10:22:22,515 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 272 [2019-09-07 10:22:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:22,517 INFO L225 Difference]: With dead ends: 451 [2019-09-07 10:22:22,517 INFO L226 Difference]: Without dead ends: 285 [2019-09-07 10:22:22,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-09-07 10:22:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-07 10:22:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-09-07 10:22:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-07 10:22:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 336 transitions. [2019-09-07 10:22:22,524 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 336 transitions. Word has length 272 [2019-09-07 10:22:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:22,524 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 336 transitions. [2019-09-07 10:22:22,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-07 10:22:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 336 transitions. [2019-09-07 10:22:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-07 10:22:22,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:22,526 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:22,526 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -301359581, now seen corresponding path program 69 times [2019-09-07 10:22:22,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:22,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:22,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:22,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:22,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6839 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-07 10:22:23,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:23,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:23,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:23:57,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-07 10:23:57,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:23:57,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:23:57,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:23:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6839 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-07 10:23:57,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:23:57,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-07 10:23:57,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:23:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:23:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:23:57,850 INFO L87 Difference]: Start difference. First operand 282 states and 336 transitions. Second operand 56 states. [2019-09-07 10:23:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:23:58,184 INFO L93 Difference]: Finished difference Result 298 states and 355 transitions. [2019-09-07 10:23:58,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:23:58,185 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 277 [2019-09-07 10:23:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:23:58,186 INFO L225 Difference]: With dead ends: 298 [2019-09-07 10:23:58,186 INFO L226 Difference]: Without dead ends: 287 [2019-09-07 10:23:58,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:23:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-07 10:23:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2019-09-07 10:23:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-07 10:23:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 340 transitions. [2019-09-07 10:23:58,191 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 340 transitions. Word has length 277 [2019-09-07 10:23:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:23:58,191 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 340 transitions. [2019-09-07 10:23:58,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:23:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 340 transitions. [2019-09-07 10:23:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-07 10:23:58,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:23:58,193 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:23:58,193 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:23:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:23:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1596190839, now seen corresponding path program 70 times [2019-09-07 10:23:58,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:23:58,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:23:58,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:58,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:23:58,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:23:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 4187 trivial. 0 not checked. [2019-09-07 10:23:59,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:23:59,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:23:59,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:23:59,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:23:59,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:23:59,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:23:59,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-07 10:24:01,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 110 [2019-09-07 10:24:01,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-07 10:24:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-07 10:24:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2019-09-07 10:24:01,634 INFO L87 Difference]: Start difference. First operand 285 states and 340 transitions. Second operand 110 states. [2019-09-07 10:24:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:02,263 INFO L93 Difference]: Finished difference Result 465 states and 578 transitions. [2019-09-07 10:24:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-07 10:24:02,263 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 280 [2019-09-07 10:24:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:02,265 INFO L225 Difference]: With dead ends: 465 [2019-09-07 10:24:02,265 INFO L226 Difference]: Without dead ends: 293 [2019-09-07 10:24:02,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2019-09-07 10:24:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-07 10:24:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-07 10:24:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-07 10:24:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 346 transitions. [2019-09-07 10:24:02,272 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 346 transitions. Word has length 280 [2019-09-07 10:24:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:02,272 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 346 transitions. [2019-09-07 10:24:02,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-07 10:24:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 346 transitions. [2019-09-07 10:24:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-07 10:24:02,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:02,274 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:02,274 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:02,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash 728116225, now seen corresponding path program 71 times [2019-09-07 10:24:02,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:02,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:02,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-09-07 10:24:03,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:03,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:03,481 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:24:32,334 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-07 10:24:32,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:32,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 10:24:32,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-09-07 10:24:32,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:32,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 10:24:32,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 10:24:32,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 10:24:32,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:24:32,424 INFO L87 Difference]: Start difference. First operand 290 states and 346 transitions. Second operand 58 states. [2019-09-07 10:24:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:32,607 INFO L93 Difference]: Finished difference Result 468 states and 580 transitions. [2019-09-07 10:24:32,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 10:24:32,607 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 285 [2019-09-07 10:24:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:32,609 INFO L225 Difference]: With dead ends: 468 [2019-09-07 10:24:32,609 INFO L226 Difference]: Without dead ends: 293 [2019-09-07 10:24:32,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:24:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-07 10:24:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-09-07 10:24:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-07 10:24:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 348 transitions. [2019-09-07 10:24:32,613 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 348 transitions. Word has length 285 [2019-09-07 10:24:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:32,614 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 348 transitions. [2019-09-07 10:24:32,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 10:24:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 348 transitions. [2019-09-07 10:24:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-07 10:24:32,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:32,616 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:32,616 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2042661919, now seen corresponding path program 72 times [2019-09-07 10:24:32,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:32,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:32,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7372 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2019-09-07 10:24:33,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:33,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:33,879 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:27:08,749 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2019-09-07 10:27:08,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:08,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:27:08,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7372 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-09-07 10:27:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 58] total 113 [2019-09-07 10:27:11,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-07 10:27:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-07 10:27:11,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-09-07 10:27:11,137 INFO L87 Difference]: Start difference. First operand 292 states and 348 transitions. Second operand 113 states. [2019-09-07 10:27:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:11,745 INFO L93 Difference]: Finished difference Result 475 states and 590 transitions. [2019-09-07 10:27:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-07 10:27:11,750 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 287 [2019-09-07 10:27:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:11,752 INFO L225 Difference]: With dead ends: 475 [2019-09-07 10:27:11,752 INFO L226 Difference]: Without dead ends: 300 [2019-09-07 10:27:11,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3024 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-09-07 10:27:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-07 10:27:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-09-07 10:27:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-07 10:27:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 354 transitions. [2019-09-07 10:27:11,758 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 354 transitions. Word has length 287 [2019-09-07 10:27:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:11,759 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 354 transitions. [2019-09-07 10:27:11,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-07 10:27:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 354 transitions. [2019-09-07 10:27:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 10:27:11,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:11,760 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:11,761 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash -68709713, now seen corresponding path program 73 times [2019-09-07 10:27:11,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:11,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:11,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7646 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2019-09-07 10:27:12,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:12,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:13,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:13,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:27:13,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7646 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2019-09-07 10:27:15,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:15,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 59] total 115 [2019-09-07 10:27:15,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-07 10:27:15,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-07 10:27:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-09-07 10:27:15,515 INFO L87 Difference]: Start difference. First operand 297 states and 354 transitions. Second operand 115 states. [2019-09-07 10:27:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:16,144 INFO L93 Difference]: Finished difference Result 483 states and 600 transitions. [2019-09-07 10:27:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-07 10:27:16,145 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 292 [2019-09-07 10:27:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:16,146 INFO L225 Difference]: With dead ends: 483 [2019-09-07 10:27:16,146 INFO L226 Difference]: Without dead ends: 305 [2019-09-07 10:27:16,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3135 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-09-07 10:27:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-07 10:27:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-09-07 10:27:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-07 10:27:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 360 transitions. [2019-09-07 10:27:16,154 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 360 transitions. Word has length 292 [2019-09-07 10:27:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:16,154 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 360 transitions. [2019-09-07 10:27:16,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-07 10:27:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 360 transitions. [2019-09-07 10:27:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-07 10:27:16,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:16,156 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:16,156 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash 884511259, now seen corresponding path program 74 times [2019-09-07 10:27:16,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:16,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:16,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7925 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-07 10:27:17,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:17,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:27:17,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:27:17,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:17,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:27:17,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7925 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 4676 trivial. 0 not checked. [2019-09-07 10:27:20,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:20,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 60] total 117 [2019-09-07 10:27:20,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-07 10:27:20,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-07 10:27:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-09-07 10:27:20,075 INFO L87 Difference]: Start difference. First operand 302 states and 360 transitions. Second operand 117 states. [2019-09-07 10:27:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:20,723 INFO L93 Difference]: Finished difference Result 491 states and 610 transitions. [2019-09-07 10:27:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-07 10:27:20,724 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 297 [2019-09-07 10:27:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:20,725 INFO L225 Difference]: With dead ends: 491 [2019-09-07 10:27:20,726 INFO L226 Difference]: Without dead ends: 310 [2019-09-07 10:27:20,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3248 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-09-07 10:27:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-07 10:27:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-09-07 10:27:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-07 10:27:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 366 transitions. [2019-09-07 10:27:20,731 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 366 transitions. Word has length 297 [2019-09-07 10:27:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:20,731 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 366 transitions. [2019-09-07 10:27:20,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-07 10:27:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 366 transitions. [2019-09-07 10:27:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-07 10:27:20,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:20,733 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:20,733 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 923179187, now seen corresponding path program 75 times [2019-09-07 10:27:20,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:20,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:20,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8209 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 3364 trivial. 0 not checked. [2019-09-07 10:27:22,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:22,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:22,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2