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/loop-invgen/string_concat-noarr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:00:23,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:00:23,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:00:23,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:00:23,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:00:23,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:00:23,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:00:23,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:00:23,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:00:23,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:00:23,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:00:23,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:00:23,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:00:23,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:00:23,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:00:23,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:00:23,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:00:23,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:00:23,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:00:23,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:00:23,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:00:23,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:00:23,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:00:23,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:00:23,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:00:23,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:00:23,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:00:23,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:00:23,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:00:23,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:00:23,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:00:23,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:00:23,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:00:23,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:00:23,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:00:23,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:00:23,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:00:23,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:00:23,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:00:23,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:00:23,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:00:23,749 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-05 12:00:23,772 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:00:23,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:00:23,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:00:23,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:00:23,775 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:00:23,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:00:23,775 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:00:23,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:00:23,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:00:23,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:00:23,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:00:23,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:00:23,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:00:23,778 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:00:23,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:00:23,778 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:00:23,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:00:23,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:00:23,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:00:23,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:00:23,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:00:23,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:00:23,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:00:23,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:00:23,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:00:23,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:00:23,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:00:23,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:00:23,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:00:23,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:00:23,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:00:23,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:00:23,840 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:00:23,840 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:00:23,841 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr.i [2019-09-05 12:00:23,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8565bc90c/cca7ff0b90ea45858cbf7bef45a06619/FLAG24b3f39da [2019-09-05 12:00:24,320 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:00:24,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/string_concat-noarr.i [2019-09-05 12:00:24,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8565bc90c/cca7ff0b90ea45858cbf7bef45a06619/FLAG24b3f39da [2019-09-05 12:00:24,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8565bc90c/cca7ff0b90ea45858cbf7bef45a06619 [2019-09-05 12:00:24,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:00:24,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:00:24,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:00:24,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:00:24,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:00:24,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:24,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b348f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24, skipping insertion in model container [2019-09-05 12:00:24,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:24,777 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:00:24,792 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:00:24,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:00:24,955 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:00:24,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:00:24,986 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:00:24,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24 WrapperNode [2019-09-05 12:00:24,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:00:24,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:00:24,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:00:24,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:00:25,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:25,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:25,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:25,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:25,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:25,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:25,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (1/1) ... [2019-09-05 12:00:25,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:00:25,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:00:25,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:00:25,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:00:25,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (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-05 12:00:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:00:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:00:25,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:00:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:00:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:00:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:00:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:00:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:00:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:00:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:00:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:00:25,349 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:00:25,349 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 12:00:25,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:00:25 BoogieIcfgContainer [2019-09-05 12:00:25,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:00:25,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:00:25,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:00:25,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:00:25,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:00:24" (1/3) ... [2019-09-05 12:00:25,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f6a0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:00:25, skipping insertion in model container [2019-09-05 12:00:25,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:00:24" (2/3) ... [2019-09-05 12:00:25,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f6a0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:00:25, skipping insertion in model container [2019-09-05 12:00:25,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:00:25" (3/3) ... [2019-09-05 12:00:25,358 INFO L109 eAbstractionObserver]: Analyzing ICFG string_concat-noarr.i [2019-09-05 12:00:25,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:00:25,376 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:00:25,399 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:00:25,437 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:00:25,438 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:00:25,438 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:00:25,439 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:00:25,439 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:00:25,439 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:00:25,439 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:00:25,439 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:00:25,440 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:00:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-05 12:00:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:00:25,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:25,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:25,468 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1261819063, now seen corresponding path program 1 times [2019-09-05 12:00:25,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:25,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:25,576 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-05 12:00:25,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:25,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:00:25,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:00:25,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:00:25,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:00:25,595 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-05 12:00:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:25,615 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-05 12:00:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:00:25,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-05 12:00:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:25,624 INFO L225 Difference]: With dead ends: 42 [2019-09-05 12:00:25,625 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 12:00:25,628 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-05 12:00:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 12:00:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 12:00:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 12:00:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-05 12:00:25,659 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-05 12:00:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:25,660 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-05 12:00:25,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:00:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-05 12:00:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:00:25,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:25,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:25,661 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash -599256242, now seen corresponding path program 1 times [2019-09-05 12:00:25,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:25,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:25,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:25,780 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-05 12:00:25,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:25,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:00:25,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:00:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:00:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:00:25,783 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2019-09-05 12:00:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:25,854 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-09-05 12:00:25,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:00:25,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 12:00:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:25,856 INFO L225 Difference]: With dead ends: 28 [2019-09-05 12:00:25,856 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 12:00:25,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:00:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 12:00:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 12:00:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 12:00:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-05 12:00:25,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2019-09-05 12:00:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:25,863 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-05 12:00:25,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:00:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-05 12:00:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:00:25,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:25,865 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:25,865 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:25,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1373758515, now seen corresponding path program 1 times [2019-09-05 12:00:25,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:25,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:25,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:25,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:25,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 12:00:25,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:00:25,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:00:25,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:00:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:00:25,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:00:25,921 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-05 12:00:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:25,986 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-05 12:00:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:00:25,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 12:00:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:25,988 INFO L225 Difference]: With dead ends: 30 [2019-09-05 12:00:25,988 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 12:00:25,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:00:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 12:00:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-09-05 12:00:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 12:00:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-05 12:00:25,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2019-09-05 12:00:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:25,994 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-05 12:00:25,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:00:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-05 12:00:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:00:25,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:25,996 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:25,996 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash -684761303, now seen corresponding path program 1 times [2019-09-05 12:00:25,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:25,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:25,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:26,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:26,074 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:26,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:26,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 12:00:26,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:26,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:26,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:26,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-05 12:00:26,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:00:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:00:26,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:00:26,215 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-09-05 12:00:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:26,315 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-09-05 12:00:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:00:26,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-05 12:00:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:26,317 INFO L225 Difference]: With dead ends: 51 [2019-09-05 12:00:26,317 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 12:00:26,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:00:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 12:00:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-09-05 12:00:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 12:00:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-05 12:00:26,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2019-09-05 12:00:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:26,325 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-05 12:00:26,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:00:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-05 12:00:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 12:00:26,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:26,326 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:26,327 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1221539890, now seen corresponding path program 1 times [2019-09-05 12:00:26,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:26,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 12:00:26,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:26,410 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) [2019-09-05 12:00:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:26,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:00:26,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:26,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:26,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:26,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-05 12:00:26,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:00:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:00:26,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:00:26,560 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 14 states. [2019-09-05 12:00:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:26,718 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-09-05 12:00:26,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:00:26,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-05 12:00:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:26,722 INFO L225 Difference]: With dead ends: 81 [2019-09-05 12:00:26,722 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 12:00:26,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:00:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 12:00:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-09-05 12:00:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 12:00:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-09-05 12:00:26,730 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2019-09-05 12:00:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:26,731 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-09-05 12:00:26,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:00:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-09-05 12:00:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:00:26,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:26,732 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:26,733 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash 754001880, now seen corresponding path program 2 times [2019-09-05 12:00:26,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:26,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:26,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 12:00:26,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:26,840 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-05 12:00:26,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:26,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:26,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:26,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:00:26,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:27,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:27,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2019-09-05 12:00:27,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:00:27,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:00:27,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:00:27,039 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 19 states. [2019-09-05 12:00:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:27,229 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2019-09-05 12:00:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:00:27,230 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-09-05 12:00:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:27,231 INFO L225 Difference]: With dead ends: 120 [2019-09-05 12:00:27,232 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 12:00:27,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:00:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 12:00:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2019-09-05 12:00:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 12:00:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-05 12:00:27,252 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 32 [2019-09-05 12:00:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:27,253 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-05 12:00:27,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:00:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-05 12:00:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:00:27,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:27,257 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:27,257 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash -678117305, now seen corresponding path program 3 times [2019-09-05 12:00:27,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:27,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:27,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:27,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:27,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-05 12:00:27,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:27,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:00:27,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:27,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 12:00:27,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:27,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:00:27,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-05 12:00:27,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:27,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-05 12:00:27,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:00:27,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:00:27,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:00:27,429 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 11 states. [2019-09-05 12:00:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:27,507 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2019-09-05 12:00:27,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:00:27,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-09-05 12:00:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:27,510 INFO L225 Difference]: With dead ends: 166 [2019-09-05 12:00:27,510 INFO L226 Difference]: Without dead ends: 160 [2019-09-05 12:00:27,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:00:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-05 12:00:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 67. [2019-09-05 12:00:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 12:00:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-09-05 12:00:27,528 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 42 [2019-09-05 12:00:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:27,529 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-09-05 12:00:27,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:00:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-09-05 12:00:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:00:27,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:27,533 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:27,533 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:27,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash -695540419, now seen corresponding path program 4 times [2019-09-05 12:00:27,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:27,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:27,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:27,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:27,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-05 12:00:27,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:27,684 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) [2019-09-05 12:00:27,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:27,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:27,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:27,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 12:00:27,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:28,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:28,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:28,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 26 [2019-09-05 12:00:28,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:00:28,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:00:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:00:28,149 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 26 states. [2019-09-05 12:00:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:28,371 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2019-09-05 12:00:28,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 12:00:28,372 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-09-05 12:00:28,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:28,373 INFO L225 Difference]: With dead ends: 195 [2019-09-05 12:00:28,373 INFO L226 Difference]: Without dead ends: 177 [2019-09-05 12:00:28,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:00:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-05 12:00:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 99. [2019-09-05 12:00:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-05 12:00:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2019-09-05 12:00:28,394 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 42 [2019-09-05 12:00:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:28,395 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2019-09-05 12:00:28,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:00:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2019-09-05 12:00:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:00:28,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:28,398 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:28,398 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash -502075658, now seen corresponding path program 5 times [2019-09-05 12:00:28,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:28,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 12:00:28,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:28,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:00:28,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:28,560 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-05 12:00:28,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:28,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:00:28,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:28,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:28,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:28,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 25] total 34 [2019-09-05 12:00:28,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:00:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:00:28,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:00:28,922 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 34 states. [2019-09-05 12:00:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:29,199 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2019-09-05 12:00:29,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 12:00:29,200 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 56 [2019-09-05 12:00:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:29,203 INFO L225 Difference]: With dead ends: 261 [2019-09-05 12:00:29,203 INFO L226 Difference]: Without dead ends: 241 [2019-09-05 12:00:29,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:00:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-05 12:00:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 136. [2019-09-05 12:00:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-05 12:00:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2019-09-05 12:00:29,213 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 56 [2019-09-05 12:00:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:29,214 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2019-09-05 12:00:29,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:00:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2019-09-05 12:00:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 12:00:29,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:29,216 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:29,216 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash -807774956, now seen corresponding path program 6 times [2019-09-05 12:00:29,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:29,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:29,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-05 12:00:29,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:29,328 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-05 12:00:29,360 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:29,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-05 12:00:29,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:29,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 12:00:29,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:29,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-05 12:00:29,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:29,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-05 12:00:29,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:00:29,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:00:29,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-05 12:00:29,471 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand 14 states. [2019-09-05 12:00:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:29,553 INFO L93 Difference]: Finished difference Result 478 states and 500 transitions. [2019-09-05 12:00:29,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:00:29,553 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-09-05 12:00:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:29,558 INFO L225 Difference]: With dead ends: 478 [2019-09-05 12:00:29,559 INFO L226 Difference]: Without dead ends: 472 [2019-09-05 12:00:29,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:00:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-05 12:00:29,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 133. [2019-09-05 12:00:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-05 12:00:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-09-05 12:00:29,591 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 72 [2019-09-05 12:00:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:29,591 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-09-05 12:00:29,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:00:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-09-05 12:00:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 12:00:29,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:29,593 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:29,598 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1944217994, now seen corresponding path program 7 times [2019-09-05 12:00:29,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:29,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:29,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:29,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:29,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:00:29,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:29,755 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-05 12:00:29,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:29,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:00:29,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:30,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:30,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:30,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 33] total 44 [2019-09-05 12:00:30,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 12:00:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 12:00:30,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:00:30,374 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 44 states. [2019-09-05 12:00:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:30,777 INFO L93 Difference]: Finished difference Result 375 states and 423 transitions. [2019-09-05 12:00:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 12:00:30,778 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 72 [2019-09-05 12:00:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:30,780 INFO L225 Difference]: With dead ends: 375 [2019-09-05 12:00:30,780 INFO L226 Difference]: Without dead ends: 351 [2019-09-05 12:00:30,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:00:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-05 12:00:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 180. [2019-09-05 12:00:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-05 12:00:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2019-09-05 12:00:30,790 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 72 [2019-09-05 12:00:30,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:30,791 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2019-09-05 12:00:30,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 12:00:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2019-09-05 12:00:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-05 12:00:30,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:30,792 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:30,793 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash 280237874, now seen corresponding path program 8 times [2019-09-05 12:00:30,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:30,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:30,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-05 12:00:30,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:30,921 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:30,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:30,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:30,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:30,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:00:30,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:31,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:31,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:31,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 43] total 55 [2019-09-05 12:00:31,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 12:00:31,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 12:00:31,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:00:31,874 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand 55 states. [2019-09-05 12:00:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:32,374 INFO L93 Difference]: Finished difference Result 468 states and 528 transitions. [2019-09-05 12:00:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 12:00:32,374 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 92 [2019-09-05 12:00:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:32,378 INFO L225 Difference]: With dead ends: 468 [2019-09-05 12:00:32,378 INFO L226 Difference]: Without dead ends: 442 [2019-09-05 12:00:32,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:00:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-05 12:00:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 232. [2019-09-05 12:00:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-05 12:00:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-09-05 12:00:32,388 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 92 [2019-09-05 12:00:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:32,388 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-09-05 12:00:32,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 12:00:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-09-05 12:00:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 12:00:32,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:32,390 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:32,390 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash -813111489, now seen corresponding path program 9 times [2019-09-05 12:00:32,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:32,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:32,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-05 12:00:32,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:32,550 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:32,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 12:00:32,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:32,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:00:32,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:32,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-09-05 12:00:32,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:32,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-05 12:00:32,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:00:32,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:00:32,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:00:32,673 INFO L87 Difference]: Start difference. First operand 232 states and 272 transitions. Second operand 17 states. [2019-09-05 12:00:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:32,760 INFO L93 Difference]: Finished difference Result 1096 states and 1136 transitions. [2019-09-05 12:00:32,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:00:32,761 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2019-09-05 12:00:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:32,766 INFO L225 Difference]: With dead ends: 1096 [2019-09-05 12:00:32,766 INFO L226 Difference]: Without dead ends: 1090 [2019-09-05 12:00:32,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-05 12:00:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-05 12:00:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 229. [2019-09-05 12:00:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-05 12:00:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 268 transitions. [2019-09-05 12:00:32,778 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 268 transitions. Word has length 114 [2019-09-05 12:00:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:32,778 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 268 transitions. [2019-09-05 12:00:32,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:00:32,779 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 268 transitions. [2019-09-05 12:00:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 12:00:32,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:32,780 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:32,780 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1403958475, now seen corresponding path program 10 times [2019-09-05 12:00:32,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:32,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:32,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-09-05 12:00:32,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:32,940 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-05 12:00:32,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:33,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:33,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:33,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 12:00:33,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:34,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 0 proven. 1614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:34,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:34,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 54] total 68 [2019-09-05 12:00:34,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 12:00:34,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 12:00:34,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:00:34,433 INFO L87 Difference]: Start difference. First operand 229 states and 268 transitions. Second operand 68 states. [2019-09-05 12:00:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:35,150 INFO L93 Difference]: Finished difference Result 621 states and 696 transitions. [2019-09-05 12:00:35,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-05 12:00:35,151 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 114 [2019-09-05 12:00:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:35,153 INFO L225 Difference]: With dead ends: 621 [2019-09-05 12:00:35,154 INFO L226 Difference]: Without dead ends: 591 [2019-09-05 12:00:35,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:00:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-05 12:00:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 291. [2019-09-05 12:00:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-05 12:00:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 342 transitions. [2019-09-05 12:00:35,164 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 342 transitions. Word has length 114 [2019-09-05 12:00:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:35,164 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 342 transitions. [2019-09-05 12:00:35,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 12:00:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 342 transitions. [2019-09-05 12:00:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-05 12:00:35,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:35,166 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:35,167 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash -554968180, now seen corresponding path program 11 times [2019-09-05 12:00:35,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:35,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-05 12:00:35,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:35,314 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-05 12:00:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:00:35,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-09-05 12:00:35,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:35,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:00:35,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:37,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:37,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:37,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 67] total 82 [2019-09-05 12:00:37,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 12:00:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 12:00:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3013, Invalid=3629, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:00:37,128 INFO L87 Difference]: Start difference. First operand 291 states and 342 transitions. Second operand 82 states. [2019-09-05 12:00:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:38,133 INFO L93 Difference]: Finished difference Result 741 states and 831 transitions. [2019-09-05 12:00:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 12:00:38,134 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 140 [2019-09-05 12:00:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:38,139 INFO L225 Difference]: With dead ends: 741 [2019-09-05 12:00:38,139 INFO L226 Difference]: Without dead ends: 709 [2019-09-05 12:00:38,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3019, Invalid=3787, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:00:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-05 12:00:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 358. [2019-09-05 12:00:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-05 12:00:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 422 transitions. [2019-09-05 12:00:38,151 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 422 transitions. Word has length 140 [2019-09-05 12:00:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:38,152 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 422 transitions. [2019-09-05 12:00:38,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 12:00:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 422 transitions. [2019-09-05 12:00:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-05 12:00:38,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:38,154 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:38,154 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:38,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash -161368504, now seen corresponding path program 12 times [2019-09-05 12:00:38,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:38,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:38,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:38,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:38,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4214 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-09-05 12:00:38,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:38,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 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-05 12:00:38,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:00:38,439 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-05 12:00:38,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:38,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 12:00:38,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:38,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4214 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-09-05 12:00:38,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:38,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-05 12:00:38,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:00:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:00:38,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:00:38,520 INFO L87 Difference]: Start difference. First operand 358 states and 422 transitions. Second operand 20 states. [2019-09-05 12:00:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:38,647 INFO L93 Difference]: Finished difference Result 2128 states and 2192 transitions. [2019-09-05 12:00:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 12:00:38,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 168 [2019-09-05 12:00:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:38,655 INFO L225 Difference]: With dead ends: 2128 [2019-09-05 12:00:38,656 INFO L226 Difference]: Without dead ends: 2122 [2019-09-05 12:00:38,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:00:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-05 12:00:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 355. [2019-09-05 12:00:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-05 12:00:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 418 transitions. [2019-09-05 12:00:38,674 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 418 transitions. Word has length 168 [2019-09-05 12:00:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:38,675 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 418 transitions. [2019-09-05 12:00:38,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:00:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 418 transitions. [2019-09-05 12:00:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-05 12:00:38,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:38,677 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:38,677 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash -78591554, now seen corresponding path program 13 times [2019-09-05 12:00:38,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:38,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4116 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2019-09-05 12:00:38,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:38,943 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:38,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:39,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 12:00:39,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4116 backedges. 0 proven. 4116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:41,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:41,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 81] total 98 [2019-09-05 12:00:41,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-05 12:00:41,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-05 12:00:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4381, Invalid=5125, Unknown=0, NotChecked=0, Total=9506 [2019-09-05 12:00:41,404 INFO L87 Difference]: Start difference. First operand 355 states and 418 transitions. Second operand 98 states. [2019-09-05 12:00:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:42,852 INFO L93 Difference]: Finished difference Result 933 states and 1041 transitions. [2019-09-05 12:00:42,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 12:00:42,853 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 168 [2019-09-05 12:00:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:42,856 INFO L225 Difference]: With dead ends: 933 [2019-09-05 12:00:42,857 INFO L226 Difference]: Without dead ends: 897 [2019-09-05 12:00:42,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4387, Invalid=5315, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:00:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-05 12:00:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 432. [2019-09-05 12:00:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-05 12:00:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 510 transitions. [2019-09-05 12:00:42,870 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 510 transitions. Word has length 168 [2019-09-05 12:00:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:42,871 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 510 transitions. [2019-09-05 12:00:42,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-05 12:00:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 510 transitions. [2019-09-05 12:00:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-05 12:00:42,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:42,873 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:42,874 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1423081476, now seen corresponding path program 14 times [2019-09-05 12:00:42,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:42,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6246 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2019-09-05 12:00:43,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:43,095 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-05 12:00:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:43,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:43,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:43,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-05 12:00:43,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:46,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6246 backedges. 0 proven. 6246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:46,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:46,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 97] total 115 [2019-09-05 12:00:46,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-05 12:00:46,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-05 12:00:46,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6115, Invalid=6995, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:00:46,409 INFO L87 Difference]: Start difference. First operand 432 states and 510 transitions. Second operand 115 states. [2019-09-05 12:00:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:48,681 INFO L93 Difference]: Finished difference Result 1080 states and 1206 transitions. [2019-09-05 12:00:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-05 12:00:48,681 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 200 [2019-09-05 12:00:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:48,687 INFO L225 Difference]: With dead ends: 1080 [2019-09-05 12:00:48,687 INFO L226 Difference]: Without dead ends: 1042 [2019-09-05 12:00:48,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6121, Invalid=7219, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:00:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-09-05 12:00:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 514. [2019-09-05 12:00:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-05 12:00:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 608 transitions. [2019-09-05 12:00:48,700 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 608 transitions. Word has length 200 [2019-09-05 12:00:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:48,700 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 608 transitions. [2019-09-05 12:00:48,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-05 12:00:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 608 transitions. [2019-09-05 12:00:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-05 12:00:48,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:48,704 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:48,704 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1244465839, now seen corresponding path program 15 times [2019-09-05 12:00:48,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:48,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:48,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9014 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2019-09-05 12:00:48,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:48,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 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-05 12:00:48,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:49,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-05 12:00:49,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:49,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:00:49,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9014 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2019-09-05 12:00:49,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:49,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-05 12:00:49,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:00:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:00:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:00:49,081 INFO L87 Difference]: Start difference. First operand 514 states and 608 transitions. Second operand 23 states. [2019-09-05 12:00:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:49,261 INFO L93 Difference]: Finished difference Result 3682 states and 3776 transitions. [2019-09-05 12:00:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 12:00:49,261 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 234 [2019-09-05 12:00:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:49,275 INFO L225 Difference]: With dead ends: 3682 [2019-09-05 12:00:49,275 INFO L226 Difference]: Without dead ends: 3676 [2019-09-05 12:00:49,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-05 12:00:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2019-09-05 12:00:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 511. [2019-09-05 12:00:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-05 12:00:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 604 transitions. [2019-09-05 12:00:49,303 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 604 transitions. Word has length 234 [2019-09-05 12:00:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:49,303 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 604 transitions. [2019-09-05 12:00:49,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:00:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 604 transitions. [2019-09-05 12:00:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-05 12:00:49,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:49,307 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:49,307 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash 409021861, now seen corresponding path program 16 times [2019-09-05 12:00:49,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:49,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:49,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:49,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 8556 trivial. 0 not checked. [2019-09-05 12:00:49,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:49,616 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-05 12:00:49,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:49,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:49,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:49,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-05 12:00:49,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 0 proven. 8862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:00:53,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:53,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 114] total 123 [2019-09-05 12:00:53,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-05 12:00:53,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-05 12:00:53,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7031, Invalid=7975, Unknown=0, NotChecked=0, Total=15006 [2019-09-05 12:00:53,599 INFO L87 Difference]: Start difference. First operand 511 states and 604 transitions. Second operand 123 states. [2019-09-05 12:00:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:56,195 INFO L93 Difference]: Finished difference Result 860 states and 985 transitions. [2019-09-05 12:00:56,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-05 12:00:56,195 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 234 [2019-09-05 12:00:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:56,199 INFO L225 Difference]: With dead ends: 860 [2019-09-05 12:00:56,199 INFO L226 Difference]: Without dead ends: 840 [2019-09-05 12:00:56,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7037, Invalid=8215, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:00:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-09-05 12:00:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 548. [2019-09-05 12:00:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-05 12:00:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 648 transitions. [2019-09-05 12:00:56,212 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 648 transitions. Word has length 234 [2019-09-05 12:00:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:56,213 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 648 transitions. [2019-09-05 12:00:56,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-05 12:00:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 648 transitions. [2019-09-05 12:00:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-05 12:00:56,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:56,218 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:56,218 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash -243253949, now seen corresponding path program 17 times [2019-09-05 12:00:56,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:56,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:56,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10242 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:00:56,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:56,537 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-05 12:00:56,552 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:00:56,767 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:00:56,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:56,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-05 12:00:56,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10242 backedges. 0 proven. 10242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:01,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:01,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 122] total 124 [2019-09-05 12:01:01,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-05 12:01:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-05 12:01:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7150, Invalid=8102, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:01:01,213 INFO L87 Difference]: Start difference. First operand 548 states and 648 transitions. Second operand 124 states. [2019-09-05 12:01:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:04,126 INFO L93 Difference]: Finished difference Result 613 states and 732 transitions. [2019-09-05 12:01:04,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-05 12:01:04,131 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 250 [2019-09-05 12:01:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:04,135 INFO L225 Difference]: With dead ends: 613 [2019-09-05 12:01:04,135 INFO L226 Difference]: Without dead ends: 607 [2019-09-05 12:01:04,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4130 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7156, Invalid=8344, Unknown=0, NotChecked=0, Total=15500 [2019-09-05 12:01:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-05 12:01:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 550. [2019-09-05 12:01:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-05 12:01:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 650 transitions. [2019-09-05 12:01:04,147 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 650 transitions. Word has length 250 [2019-09-05 12:01:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:04,148 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 650 transitions. [2019-09-05 12:01:04,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-05 12:01:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 650 transitions. [2019-09-05 12:01:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-05 12:01:04,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:04,151 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:04,151 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2131025886, now seen corresponding path program 18 times [2019-09-05 12:01:04,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:04,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:04,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:04,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:04,488 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:04,517 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:04,637 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-09-05 12:01:04,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:04,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:01:04,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:04,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:04,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:04,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-05 12:01:04,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:01:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:01:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-05 12:01:04,716 INFO L87 Difference]: Start difference. First operand 550 states and 650 transitions. Second operand 26 states. [2019-09-05 12:01:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:04,887 INFO L93 Difference]: Finished difference Result 4516 states and 4616 transitions. [2019-09-05 12:01:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 12:01:04,890 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 252 [2019-09-05 12:01:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:04,903 INFO L225 Difference]: With dead ends: 4516 [2019-09-05 12:01:04,903 INFO L226 Difference]: Without dead ends: 4510 [2019-09-05 12:01:04,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:01:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2019-09-05 12:01:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 547. [2019-09-05 12:01:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-05 12:01:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 646 transitions. [2019-09-05 12:01:04,933 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 646 transitions. Word has length 252 [2019-09-05 12:01:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:04,933 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 646 transitions. [2019-09-05 12:01:04,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:01:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 646 transitions. [2019-09-05 12:01:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-05 12:01:04,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:04,936 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:04,936 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1062498900, now seen corresponding path program 19 times [2019-09-05 12:01:04,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:04,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:04,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10122 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:01:05,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:05,249 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-05 12:01:05,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:05,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-05 12:01:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10122 backedges. 0 proven. 10122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:09,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:09,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 123] total 126 [2019-09-05 12:01:09,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-05 12:01:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-05 12:01:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2019-09-05 12:01:09,475 INFO L87 Difference]: Start difference. First operand 547 states and 646 transitions. Second operand 126 states. [2019-09-05 12:01:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:12,309 INFO L93 Difference]: Finished difference Result 665 states and 787 transitions. [2019-09-05 12:01:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-05 12:01:12,309 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 252 [2019-09-05 12:01:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:12,311 INFO L225 Difference]: With dead ends: 665 [2019-09-05 12:01:12,312 INFO L226 Difference]: Without dead ends: 657 [2019-09-05 12:01:12,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:01:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-05 12:01:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 554. [2019-09-05 12:01:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-05 12:01:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 654 transitions. [2019-09-05 12:01:12,323 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 654 transitions. Word has length 252 [2019-09-05 12:01:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:12,323 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 654 transitions. [2019-09-05 12:01:12,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-05 12:01:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 654 transitions. [2019-09-05 12:01:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-05 12:01:12,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:12,326 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:12,326 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash -589880108, now seen corresponding path program 20 times [2019-09-05 12:01:12,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:12,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10362 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:12,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:12,693 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-05 12:01:12,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:12,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:12,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:12,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-05 12:01:12,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:16,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10362 backedges. 0 proven. 10362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:16,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:16,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 125] total 127 [2019-09-05 12:01:16,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-05 12:01:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-05 12:01:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7513, Invalid=8489, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:01:16,531 INFO L87 Difference]: Start difference. First operand 554 states and 654 transitions. Second operand 127 states. [2019-09-05 12:01:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:19,062 INFO L93 Difference]: Finished difference Result 628 states and 750 transitions. [2019-09-05 12:01:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-05 12:01:19,062 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 256 [2019-09-05 12:01:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:19,066 INFO L225 Difference]: With dead ends: 628 [2019-09-05 12:01:19,066 INFO L226 Difference]: Without dead ends: 622 [2019-09-05 12:01:19,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4736 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7519, Invalid=8737, Unknown=0, NotChecked=0, Total=16256 [2019-09-05 12:01:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-05 12:01:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 556. [2019-09-05 12:01:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-09-05 12:01:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 656 transitions. [2019-09-05 12:01:19,078 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 656 transitions. Word has length 256 [2019-09-05 12:01:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:19,079 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 656 transitions. [2019-09-05 12:01:19,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-05 12:01:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 656 transitions. [2019-09-05 12:01:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-05 12:01:19,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:19,082 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:19,082 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash -264231121, now seen corresponding path program 21 times [2019-09-05 12:01:19,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:19,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:19,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10406 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:19,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:19,787 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) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:19,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:19,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-05 12:01:19,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:19,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:01:19,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10406 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:19,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:19,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-05 12:01:19,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 12:01:19,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 12:01:19,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:01:19,993 INFO L87 Difference]: Start difference. First operand 556 states and 656 transitions. Second operand 29 states. [2019-09-05 12:01:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:20,207 INFO L93 Difference]: Finished difference Result 5116 states and 5216 transitions. [2019-09-05 12:01:20,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:01:20,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 258 [2019-09-05 12:01:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:20,224 INFO L225 Difference]: With dead ends: 5116 [2019-09-05 12:01:20,224 INFO L226 Difference]: Without dead ends: 5110 [2019-09-05 12:01:20,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-05 12:01:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2019-09-05 12:01:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 553. [2019-09-05 12:01:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-05 12:01:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 652 transitions. [2019-09-05 12:01:20,250 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 652 transitions. Word has length 258 [2019-09-05 12:01:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:20,250 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 652 transitions. [2019-09-05 12:01:20,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 12:01:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 652 transitions. [2019-09-05 12:01:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-05 12:01:20,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:20,253 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:20,253 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1455847131, now seen corresponding path program 22 times [2019-09-05 12:01:20,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:20,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:20,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10254 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:01:20,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:20,625 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-05 12:01:20,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:20,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:20,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:20,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-05 12:01:20,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:24,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10254 backedges. 0 proven. 10254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:24,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:24,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 126] total 129 [2019-09-05 12:01:24,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-05 12:01:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-05 12:01:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7760, Invalid=8752, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:01:24,501 INFO L87 Difference]: Start difference. First operand 553 states and 652 transitions. Second operand 129 states. [2019-09-05 12:01:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:27,857 INFO L93 Difference]: Finished difference Result 686 states and 811 transitions. [2019-09-05 12:01:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-05 12:01:27,857 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 258 [2019-09-05 12:01:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:27,861 INFO L225 Difference]: With dead ends: 686 [2019-09-05 12:01:27,862 INFO L226 Difference]: Without dead ends: 678 [2019-09-05 12:01:27,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5140 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7766, Invalid=9004, Unknown=0, NotChecked=0, Total=16770 [2019-09-05 12:01:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-09-05 12:01:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 560. [2019-09-05 12:01:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-05 12:01:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 660 transitions. [2019-09-05 12:01:27,870 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 660 transitions. Word has length 258 [2019-09-05 12:01:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:27,871 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 660 transitions. [2019-09-05 12:01:27,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-05 12:01:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 660 transitions. [2019-09-05 12:01:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-05 12:01:27,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:27,873 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:27,873 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:27,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:27,874 INFO L82 PathProgramCache]: Analyzing trace with hash 629955493, now seen corresponding path program 23 times [2019-09-05 12:01:27,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:27,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:27,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:27,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10500 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:28,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:28,272 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-05 12:01:28,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:28,498 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:01:28,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:28,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-05 12:01:28,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:32,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10500 backedges. 0 proven. 10500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:32,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:32,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 128] total 130 [2019-09-05 12:01:32,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-05 12:01:32,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-05 12:01:32,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7885, Invalid=8885, Unknown=0, NotChecked=0, Total=16770 [2019-09-05 12:01:32,470 INFO L87 Difference]: Start difference. First operand 560 states and 660 transitions. Second operand 130 states. [2019-09-05 12:01:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:35,208 INFO L93 Difference]: Finished difference Result 643 states and 768 transitions. [2019-09-05 12:01:35,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-05 12:01:35,209 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 262 [2019-09-05 12:01:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:35,212 INFO L225 Difference]: With dead ends: 643 [2019-09-05 12:01:35,212 INFO L226 Difference]: Without dead ends: 637 [2019-09-05 12:01:35,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5342 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7891, Invalid=9139, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:01:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-05 12:01:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 562. [2019-09-05 12:01:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-05 12:01:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 662 transitions. [2019-09-05 12:01:35,220 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 662 transitions. Word has length 262 [2019-09-05 12:01:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:35,220 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 662 transitions. [2019-09-05 12:01:35,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-05 12:01:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 662 transitions. [2019-09-05 12:01:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-05 12:01:35,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:35,223 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:35,223 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash -528290368, now seen corresponding path program 24 times [2019-09-05 12:01:35,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:35,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:35,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:35,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10550 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:35,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:35,608 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-05 12:01:35,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:35,740 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2019-09-05 12:01:35,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:35,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:01:35,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:35,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10550 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:35,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:35,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-05 12:01:35,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:01:35,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:01:35,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:01:35,813 INFO L87 Difference]: Start difference. First operand 562 states and 662 transitions. Second operand 32 states. [2019-09-05 12:01:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:36,042 INFO L93 Difference]: Finished difference Result 5716 states and 5816 transitions. [2019-09-05 12:01:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 12:01:36,042 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 264 [2019-09-05 12:01:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:36,063 INFO L225 Difference]: With dead ends: 5716 [2019-09-05 12:01:36,063 INFO L226 Difference]: Without dead ends: 5710 [2019-09-05 12:01:36,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:01:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2019-09-05 12:01:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 559. [2019-09-05 12:01:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-05 12:01:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 658 transitions. [2019-09-05 12:01:36,091 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 658 transitions. Word has length 264 [2019-09-05 12:01:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:36,092 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 658 transitions. [2019-09-05 12:01:36,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:01:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 658 transitions. [2019-09-05 12:01:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-05 12:01:36,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:36,095 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:36,095 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1282178870, now seen corresponding path program 25 times [2019-09-05 12:01:36,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:36,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:36,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:01:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:36,565 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) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:36,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:36,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-05 12:01:36,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:40,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:40,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:40,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 129] total 132 [2019-09-05 12:01:40,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-05 12:01:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-05 12:01:40,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8138, Invalid=9154, Unknown=0, NotChecked=0, Total=17292 [2019-09-05 12:01:40,495 INFO L87 Difference]: Start difference. First operand 559 states and 658 transitions. Second operand 132 states. [2019-09-05 12:01:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:43,619 INFO L93 Difference]: Finished difference Result 707 states and 835 transitions. [2019-09-05 12:01:43,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-05 12:01:43,620 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 264 [2019-09-05 12:01:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:43,623 INFO L225 Difference]: With dead ends: 707 [2019-09-05 12:01:43,623 INFO L226 Difference]: Without dead ends: 699 [2019-09-05 12:01:43,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5746 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8144, Invalid=9412, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:01:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-05 12:01:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 566. [2019-09-05 12:01:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-05 12:01:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 666 transitions. [2019-09-05 12:01:43,632 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 666 transitions. Word has length 264 [2019-09-05 12:01:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:43,633 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 666 transitions. [2019-09-05 12:01:43,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-05 12:01:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 666 transitions. [2019-09-05 12:01:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-05 12:01:43,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:43,635 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:43,636 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash 318206390, now seen corresponding path program 26 times [2019-09-05 12:01:43,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:43,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:43,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:44,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:44,109 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-05 12:01:44,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:44,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:44,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:44,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-05 12:01:44,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:47,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:47,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 131] total 133 [2019-09-05 12:01:47,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-05 12:01:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-05 12:01:47,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8266, Invalid=9290, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:01:47,965 INFO L87 Difference]: Start difference. First operand 566 states and 666 transitions. Second operand 133 states. [2019-09-05 12:01:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:51,123 INFO L93 Difference]: Finished difference Result 658 states and 786 transitions. [2019-09-05 12:01:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-05 12:01:51,124 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 268 [2019-09-05 12:01:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:51,127 INFO L225 Difference]: With dead ends: 658 [2019-09-05 12:01:51,127 INFO L226 Difference]: Without dead ends: 652 [2019-09-05 12:01:51,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5948 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8272, Invalid=9550, Unknown=0, NotChecked=0, Total=17822 [2019-09-05 12:01:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-05 12:01:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 568. [2019-09-05 12:01:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-05 12:01:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 668 transitions. [2019-09-05 12:01:51,135 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 668 transitions. Word has length 268 [2019-09-05 12:01:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:51,136 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 668 transitions. [2019-09-05 12:01:51,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-05 12:01:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 668 transitions. [2019-09-05 12:01:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-05 12:01:51,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:51,138 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:51,141 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 528532369, now seen corresponding path program 27 times [2019-09-05 12:01:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:51,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:51,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:51,618 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-05 12:01:51,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:51,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-05 12:01:51,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:51,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:01:51,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:51,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:01:51,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:51,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-05 12:01:51,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 12:01:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 12:01:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:01:51,823 INFO L87 Difference]: Start difference. First operand 568 states and 668 transitions. Second operand 35 states. [2019-09-05 12:01:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:52,113 INFO L93 Difference]: Finished difference Result 6316 states and 6416 transitions. [2019-09-05 12:01:52,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:01:52,113 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 270 [2019-09-05 12:01:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:52,122 INFO L225 Difference]: With dead ends: 6316 [2019-09-05 12:01:52,122 INFO L226 Difference]: Without dead ends: 6310 [2019-09-05 12:01:52,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:01:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2019-09-05 12:01:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 565. [2019-09-05 12:01:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-05 12:01:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 664 transitions. [2019-09-05 12:01:52,153 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 664 transitions. Word has length 270 [2019-09-05 12:01:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:52,153 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 664 transitions. [2019-09-05 12:01:52,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 12:01:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 664 transitions. [2019-09-05 12:01:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-05 12:01:52,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:52,156 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:52,156 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:52,156 INFO L82 PathProgramCache]: Analyzing trace with hash 39380103, now seen corresponding path program 28 times [2019-09-05 12:01:52,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:52,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:52,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:52,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10572 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:01:52,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:52,711 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) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:52,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:52,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:52,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:52,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-05 12:01:52,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:56,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10572 backedges. 0 proven. 10572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:01:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 132] total 135 [2019-09-05 12:01:56,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-05 12:01:56,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-05 12:01:56,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8525, Invalid=9565, Unknown=0, NotChecked=0, Total=18090 [2019-09-05 12:01:56,619 INFO L87 Difference]: Start difference. First operand 565 states and 664 transitions. Second operand 135 states. [2019-09-05 12:02:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:00,369 INFO L93 Difference]: Finished difference Result 728 states and 859 transitions. [2019-09-05 12:02:00,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-05 12:02:00,369 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 270 [2019-09-05 12:02:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:00,371 INFO L225 Difference]: With dead ends: 728 [2019-09-05 12:02:00,371 INFO L226 Difference]: Without dead ends: 720 [2019-09-05 12:02:00,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6352 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8531, Invalid=9829, Unknown=0, NotChecked=0, Total=18360 [2019-09-05 12:02:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-09-05 12:02:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 572. [2019-09-05 12:02:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-05 12:02:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 672 transitions. [2019-09-05 12:02:00,380 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 672 transitions. Word has length 270 [2019-09-05 12:02:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:00,381 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 672 transitions. [2019-09-05 12:02:00,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-05 12:02:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 672 transitions. [2019-09-05 12:02:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-05 12:02:00,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:00,384 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:00,384 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:00,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:00,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1350825735, now seen corresponding path program 29 times [2019-09-05 12:02:00,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:00,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:00,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:00,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:00,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10830 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:00,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:00,955 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-05 12:02:00,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:01,304 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:02:01,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:01,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-05 12:02:01,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:04,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10830 backedges. 0 proven. 10830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:04,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:04,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 134] total 136 [2019-09-05 12:02:04,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-05 12:02:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-05 12:02:04,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8656, Invalid=9704, Unknown=0, NotChecked=0, Total=18360 [2019-09-05 12:02:04,944 INFO L87 Difference]: Start difference. First operand 572 states and 672 transitions. Second operand 136 states. [2019-09-05 12:02:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:08,723 INFO L93 Difference]: Finished difference Result 673 states and 804 transitions. [2019-09-05 12:02:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-05 12:02:08,724 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 274 [2019-09-05 12:02:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:08,726 INFO L225 Difference]: With dead ends: 673 [2019-09-05 12:02:08,727 INFO L226 Difference]: Without dead ends: 667 [2019-09-05 12:02:08,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8662, Invalid=9970, Unknown=0, NotChecked=0, Total=18632 [2019-09-05 12:02:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-09-05 12:02:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 574. [2019-09-05 12:02:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-05 12:02:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 674 transitions. [2019-09-05 12:02:08,737 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 674 transitions. Word has length 274 [2019-09-05 12:02:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:08,737 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 674 transitions. [2019-09-05 12:02:08,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-05 12:02:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 674 transitions. [2019-09-05 12:02:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-05 12:02:08,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:08,740 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:08,740 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash 738277538, now seen corresponding path program 30 times [2019-09-05 12:02:08,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:08,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:08,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10892 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:09,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:09,308 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:09,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:09,467 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2019-09-05 12:02:09,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:09,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:02:09,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:09,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10892 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:09,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:09,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-05 12:02:09,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 12:02:09,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 12:02:09,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:02:09,569 INFO L87 Difference]: Start difference. First operand 574 states and 674 transitions. Second operand 38 states. [2019-09-05 12:02:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:09,885 INFO L93 Difference]: Finished difference Result 6916 states and 7016 transitions. [2019-09-05 12:02:09,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 12:02:09,886 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 276 [2019-09-05 12:02:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:09,896 INFO L225 Difference]: With dead ends: 6916 [2019-09-05 12:02:09,896 INFO L226 Difference]: Without dead ends: 6910 [2019-09-05 12:02:09,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:02:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6910 states. [2019-09-05 12:02:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6910 to 571. [2019-09-05 12:02:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-05 12:02:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 670 transitions. [2019-09-05 12:02:09,943 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 670 transitions. Word has length 276 [2019-09-05 12:02:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:09,943 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 670 transitions. [2019-09-05 12:02:09,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 12:02:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 670 transitions. [2019-09-05 12:02:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-05 12:02:09,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:09,946 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:09,947 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 696142104, now seen corresponding path program 31 times [2019-09-05 12:02:09,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:09,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10758 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:02:10,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:10,503 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) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:10,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:10,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-05 12:02:10,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:14,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10758 backedges. 0 proven. 10758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:14,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:14,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 135] total 138 [2019-09-05 12:02:14,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-05 12:02:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-05 12:02:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8921, Invalid=9985, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 12:02:14,296 INFO L87 Difference]: Start difference. First operand 571 states and 670 transitions. Second operand 138 states. [2019-09-05 12:02:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:17,501 INFO L93 Difference]: Finished difference Result 749 states and 883 transitions. [2019-09-05 12:02:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-05 12:02:17,501 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 276 [2019-09-05 12:02:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:17,504 INFO L225 Difference]: With dead ends: 749 [2019-09-05 12:02:17,504 INFO L226 Difference]: Without dead ends: 741 [2019-09-05 12:02:17,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6958 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8927, Invalid=10255, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:02:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-05 12:02:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 578. [2019-09-05 12:02:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-05 12:02:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 678 transitions. [2019-09-05 12:02:17,512 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 678 transitions. Word has length 276 [2019-09-05 12:02:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:17,513 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 678 transitions. [2019-09-05 12:02:17,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-05 12:02:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 678 transitions. [2019-09-05 12:02:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-05 12:02:17,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:17,515 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:17,516 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:17,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1900971112, now seen corresponding path program 32 times [2019-09-05 12:02:17,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:17,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:17,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:17,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:17,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11022 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:18,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:18,107 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) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:18,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:02:18,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:18,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:18,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-05 12:02:18,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:21,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11022 backedges. 0 proven. 11022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:21,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:21,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 137] total 139 [2019-09-05 12:02:21,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-05 12:02:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-05 12:02:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9055, Invalid=10127, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:02:21,844 INFO L87 Difference]: Start difference. First operand 578 states and 678 transitions. Second operand 139 states. [2019-09-05 12:02:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:25,396 INFO L93 Difference]: Finished difference Result 688 states and 822 transitions. [2019-09-05 12:02:25,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-05 12:02:25,397 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 280 [2019-09-05 12:02:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:25,399 INFO L225 Difference]: With dead ends: 688 [2019-09-05 12:02:25,399 INFO L226 Difference]: Without dead ends: 682 [2019-09-05 12:02:25,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7160 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=9061, Invalid=10399, Unknown=0, NotChecked=0, Total=19460 [2019-09-05 12:02:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-05 12:02:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 580. [2019-09-05 12:02:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-05 12:02:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 680 transitions. [2019-09-05 12:02:25,408 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 680 transitions. Word has length 280 [2019-09-05 12:02:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:25,408 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 680 transitions. [2019-09-05 12:02:25,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-05 12:02:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 680 transitions. [2019-09-05 12:02:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-05 12:02:25,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:25,411 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:25,411 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1797268237, now seen corresponding path program 33 times [2019-09-05 12:02:25,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:25,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:25,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:25,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11090 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:26,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:26,099 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-05 12:02:26,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:02:26,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-05 12:02:26,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:26,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 12:02:26,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:26,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11090 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:26,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:26,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-05 12:02:26,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 12:02:26,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 12:02:26,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:02:26,292 INFO L87 Difference]: Start difference. First operand 580 states and 680 transitions. Second operand 41 states. [2019-09-05 12:02:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:26,632 INFO L93 Difference]: Finished difference Result 7516 states and 7616 transitions. [2019-09-05 12:02:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:02:26,632 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 282 [2019-09-05 12:02:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:26,640 INFO L225 Difference]: With dead ends: 7516 [2019-09-05 12:02:26,640 INFO L226 Difference]: Without dead ends: 7510 [2019-09-05 12:02:26,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:02:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2019-09-05 12:02:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 577. [2019-09-05 12:02:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-05 12:02:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 676 transitions. [2019-09-05 12:02:26,674 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 676 transitions. Word has length 282 [2019-09-05 12:02:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:26,674 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 676 transitions. [2019-09-05 12:02:26,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 12:02:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 676 transitions. [2019-09-05 12:02:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-05 12:02:26,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:26,677 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:26,677 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2039464727, now seen corresponding path program 34 times [2019-09-05 12:02:26,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:26,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:26,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:26,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10962 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:02:27,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:27,321 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-05 12:02:27,331 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:02:27,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:02:27,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-05 12:02:27,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:30,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10962 backedges. 0 proven. 10962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:31,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:31,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 138] total 141 [2019-09-05 12:02:31,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-05 12:02:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-05 12:02:31,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9326, Invalid=10414, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:02:31,034 INFO L87 Difference]: Start difference. First operand 577 states and 676 transitions. Second operand 141 states. [2019-09-05 12:02:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:34,716 INFO L93 Difference]: Finished difference Result 770 states and 907 transitions. [2019-09-05 12:02:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-05 12:02:34,717 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 282 [2019-09-05 12:02:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:34,719 INFO L225 Difference]: With dead ends: 770 [2019-09-05 12:02:34,719 INFO L226 Difference]: Without dead ends: 762 [2019-09-05 12:02:34,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=9332, Invalid=10690, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:02:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-05 12:02:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 584. [2019-09-05 12:02:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-05 12:02:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 684 transitions. [2019-09-05 12:02:34,727 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 684 transitions. Word has length 282 [2019-09-05 12:02:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:34,727 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 684 transitions. [2019-09-05 12:02:34,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-05 12:02:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 684 transitions. [2019-09-05 12:02:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-05 12:02:34,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:34,730 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:34,730 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1679003497, now seen corresponding path program 35 times [2019-09-05 12:02:34,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:34,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:34,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:34,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11232 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:35,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:35,426 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-05 12:02:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:35,653 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:02:35,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:35,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-05 12:02:35,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:39,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11232 backedges. 0 proven. 11232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:39,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:39,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 140] total 142 [2019-09-05 12:02:39,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-05 12:02:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-05 12:02:39,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:02:39,367 INFO L87 Difference]: Start difference. First operand 584 states and 684 transitions. Second operand 142 states. [2019-09-05 12:02:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:43,292 INFO L93 Difference]: Finished difference Result 703 states and 840 transitions. [2019-09-05 12:02:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-05 12:02:43,293 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 286 [2019-09-05 12:02:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:43,295 INFO L225 Difference]: With dead ends: 703 [2019-09-05 12:02:43,295 INFO L226 Difference]: Without dead ends: 697 [2019-09-05 12:02:43,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7766 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2019-09-05 12:02:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-05 12:02:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 586. [2019-09-05 12:02:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-05 12:02:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 686 transitions. [2019-09-05 12:02:43,303 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 686 transitions. Word has length 286 [2019-09-05 12:02:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:43,303 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 686 transitions. [2019-09-05 12:02:43,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-05 12:02:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 686 transitions. [2019-09-05 12:02:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-05 12:02:43,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:43,306 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:43,306 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1710473084, now seen corresponding path program 36 times [2019-09-05 12:02:43,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:43,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:43,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:43,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:43,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11306 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:44,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:44,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 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-05 12:02:44,014 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:44,197 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2019-09-05 12:02:44,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:44,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 12:02:44,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:44,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11306 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:44,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:44,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-05 12:02:44,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 12:02:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 12:02:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:02:44,280 INFO L87 Difference]: Start difference. First operand 586 states and 686 transitions. Second operand 44 states. [2019-09-05 12:02:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:44,642 INFO L93 Difference]: Finished difference Result 8116 states and 8216 transitions. [2019-09-05 12:02:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 12:02:44,643 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 288 [2019-09-05 12:02:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:44,649 INFO L225 Difference]: With dead ends: 8116 [2019-09-05 12:02:44,649 INFO L226 Difference]: Without dead ends: 8110 [2019-09-05 12:02:44,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:02:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8110 states. [2019-09-05 12:02:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8110 to 583. [2019-09-05 12:02:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-05 12:02:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 682 transitions. [2019-09-05 12:02:44,674 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 682 transitions. Word has length 288 [2019-09-05 12:02:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:44,675 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 682 transitions. [2019-09-05 12:02:44,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 12:02:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 682 transitions. [2019-09-05 12:02:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-05 12:02:44,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:44,677 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:44,677 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1691766778, now seen corresponding path program 37 times [2019-09-05 12:02:44,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:44,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:44,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:44,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11184 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:02:45,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:45,395 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-05 12:02:45,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:45,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-05 12:02:45,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:49,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11184 backedges. 0 proven. 11184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:49,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:49,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 141] total 144 [2019-09-05 12:02:49,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-05 12:02:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-05 12:02:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9740, Invalid=10852, Unknown=0, NotChecked=0, Total=20592 [2019-09-05 12:02:49,129 INFO L87 Difference]: Start difference. First operand 583 states and 682 transitions. Second operand 144 states. [2019-09-05 12:02:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:53,416 INFO L93 Difference]: Finished difference Result 791 states and 931 transitions. [2019-09-05 12:02:53,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-05 12:02:53,417 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 288 [2019-09-05 12:02:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:53,418 INFO L225 Difference]: With dead ends: 791 [2019-09-05 12:02:53,418 INFO L226 Difference]: Without dead ends: 783 [2019-09-05 12:02:53,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8170 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=9746, Invalid=11134, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 12:02:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-05 12:02:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 590. [2019-09-05 12:02:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-05 12:02:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 690 transitions. [2019-09-05 12:02:53,425 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 690 transitions. Word has length 288 [2019-09-05 12:02:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:53,426 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 690 transitions. [2019-09-05 12:02:53,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-05 12:02:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 690 transitions. [2019-09-05 12:02:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-05 12:02:53,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:53,428 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:53,428 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:53,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1850851962, now seen corresponding path program 38 times [2019-09-05 12:02:53,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11460 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:02:54,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:54,153 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) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:54,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:02:54,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:54,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:54,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-05 12:02:54,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:57,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11460 backedges. 0 proven. 11460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:02:57,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:57,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 143] total 145 [2019-09-05 12:02:57,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-05 12:02:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-05 12:02:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9880, Invalid=11000, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 12:02:57,973 INFO L87 Difference]: Start difference. First operand 590 states and 690 transitions. Second operand 145 states. [2019-09-05 12:03:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:02,016 INFO L93 Difference]: Finished difference Result 718 states and 858 transitions. [2019-09-05 12:03:02,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-05 12:03:02,017 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 292 [2019-09-05 12:03:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:02,018 INFO L225 Difference]: With dead ends: 718 [2019-09-05 12:03:02,018 INFO L226 Difference]: Without dead ends: 712 [2019-09-05 12:03:02,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9886, Invalid=11284, Unknown=0, NotChecked=0, Total=21170 [2019-09-05 12:03:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-05 12:03:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 592. [2019-09-05 12:03:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-05 12:03:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 692 transitions. [2019-09-05 12:03:02,025 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 692 transitions. Word has length 292 [2019-09-05 12:03:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:02,025 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 692 transitions. [2019-09-05 12:03:02,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-05 12:03:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 692 transitions. [2019-09-05 12:03:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-05 12:03:02,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:02,027 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:02,028 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 227144533, now seen corresponding path program 39 times [2019-09-05 12:03:02,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:02,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:02,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:02,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:02,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11540 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:02,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:02,922 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) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:03,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-05 12:03:03,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:03,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 12:03:03,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:03,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11540 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:03,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:03,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-05 12:03:03,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 12:03:03,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 12:03:03,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:03:03,169 INFO L87 Difference]: Start difference. First operand 592 states and 692 transitions. Second operand 47 states. [2019-09-05 12:03:03,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:03,583 INFO L93 Difference]: Finished difference Result 8716 states and 8816 transitions. [2019-09-05 12:03:03,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 12:03:03,584 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 294 [2019-09-05 12:03:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:03,590 INFO L225 Difference]: With dead ends: 8716 [2019-09-05 12:03:03,590 INFO L226 Difference]: Without dead ends: 8710 [2019-09-05 12:03:03,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:03:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-09-05 12:03:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 589. [2019-09-05 12:03:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-05 12:03:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 688 transitions. [2019-09-05 12:03:03,619 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 688 transitions. Word has length 294 [2019-09-05 12:03:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:03,619 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 688 transitions. [2019-09-05 12:03:03,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 12:03:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 688 transitions. [2019-09-05 12:03:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-05 12:03:03,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:03,622 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:03,622 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:03,623 INFO L82 PathProgramCache]: Analyzing trace with hash -127135157, now seen corresponding path program 40 times [2019-09-05 12:03:03,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:03,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:03,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:03,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11424 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:03:04,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:04,567 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-05 12:03:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:04,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:04,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:04,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-05 12:03:04,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:08,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11424 backedges. 0 proven. 11424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:08,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:08,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 144] total 147 [2019-09-05 12:03:08,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-05 12:03:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-05 12:03:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10163, Invalid=11299, Unknown=0, NotChecked=0, Total=21462 [2019-09-05 12:03:08,427 INFO L87 Difference]: Start difference. First operand 589 states and 688 transitions. Second operand 147 states. [2019-09-05 12:03:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:12,813 INFO L93 Difference]: Finished difference Result 812 states and 955 transitions. [2019-09-05 12:03:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-05 12:03:12,814 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 294 [2019-09-05 12:03:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:12,815 INFO L225 Difference]: With dead ends: 812 [2019-09-05 12:03:12,815 INFO L226 Difference]: Without dead ends: 804 [2019-09-05 12:03:12,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8776 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=10169, Invalid=11587, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:03:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-09-05 12:03:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 596. [2019-09-05 12:03:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-05 12:03:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 696 transitions. [2019-09-05 12:03:12,822 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 696 transitions. Word has length 294 [2019-09-05 12:03:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:12,822 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 696 transitions. [2019-09-05 12:03:12,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-05 12:03:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 696 transitions. [2019-09-05 12:03:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-05 12:03:12,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:12,823 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:12,824 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1289247541, now seen corresponding path program 41 times [2019-09-05 12:03:12,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:12,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:12,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:12,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:12,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11706 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:13,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:13,930 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) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:13,941 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:03:14,176 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:03:14,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:14,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-05 12:03:14,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:17,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11706 backedges. 0 proven. 11706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:17,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:17,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 146] total 148 [2019-09-05 12:03:17,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-05 12:03:17,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-05 12:03:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10306, Invalid=11450, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:03:17,815 INFO L87 Difference]: Start difference. First operand 596 states and 696 transitions. Second operand 148 states. [2019-09-05 12:03:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:22,694 INFO L93 Difference]: Finished difference Result 733 states and 876 transitions. [2019-09-05 12:03:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-05 12:03:22,695 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 298 [2019-09-05 12:03:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:22,696 INFO L225 Difference]: With dead ends: 733 [2019-09-05 12:03:22,696 INFO L226 Difference]: Without dead ends: 727 [2019-09-05 12:03:22,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8978 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=10312, Invalid=11740, Unknown=0, NotChecked=0, Total=22052 [2019-09-05 12:03:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-05 12:03:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 598. [2019-09-05 12:03:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-05 12:03:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 698 transitions. [2019-09-05 12:03:22,702 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 698 transitions. Word has length 298 [2019-09-05 12:03:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:22,702 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 698 transitions. [2019-09-05 12:03:22,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-05 12:03:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 698 transitions. [2019-09-05 12:03:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-05 12:03:22,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:22,704 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:22,704 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1953531238, now seen corresponding path program 42 times [2019-09-05 12:03:22,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:22,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:22,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11792 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:23,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:23,567 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-05 12:03:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:03:23,820 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2019-09-05 12:03:23,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:23,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 12:03:23,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11792 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:23,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:23,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-05 12:03:23,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 12:03:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 12:03:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:03:23,943 INFO L87 Difference]: Start difference. First operand 598 states and 698 transitions. Second operand 50 states. [2019-09-05 12:03:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:24,399 INFO L93 Difference]: Finished difference Result 9316 states and 9416 transitions. [2019-09-05 12:03:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 12:03:24,400 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 300 [2019-09-05 12:03:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:24,406 INFO L225 Difference]: With dead ends: 9316 [2019-09-05 12:03:24,406 INFO L226 Difference]: Without dead ends: 9310 [2019-09-05 12:03:24,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:03:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9310 states. [2019-09-05 12:03:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9310 to 595. [2019-09-05 12:03:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-05 12:03:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 694 transitions. [2019-09-05 12:03:24,441 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 694 transitions. Word has length 300 [2019-09-05 12:03:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:24,441 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 694 transitions. [2019-09-05 12:03:24,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 12:03:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 694 transitions. [2019-09-05 12:03:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-05 12:03:24,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:24,444 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 45, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:24,444 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash -33483812, now seen corresponding path program 43 times [2019-09-05 12:03:24,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:24,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:24,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:03:25,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:25,906 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-05 12:03:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:26,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-05 12:03:26,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:30,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 0 proven. 11682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:30,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:30,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 147] total 150 [2019-09-05 12:03:30,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-05 12:03:30,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-05 12:03:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10595, Invalid=11755, Unknown=0, NotChecked=0, Total=22350 [2019-09-05 12:03:30,654 INFO L87 Difference]: Start difference. First operand 595 states and 694 transitions. Second operand 150 states. [2019-09-05 12:03:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:36,122 INFO L93 Difference]: Finished difference Result 833 states and 979 transitions. [2019-09-05 12:03:36,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-05 12:03:36,123 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 300 [2019-09-05 12:03:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:36,125 INFO L225 Difference]: With dead ends: 833 [2019-09-05 12:03:36,125 INFO L226 Difference]: Without dead ends: 825 [2019-09-05 12:03:36,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9382 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10601, Invalid=12049, Unknown=0, NotChecked=0, Total=22650 [2019-09-05 12:03:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-09-05 12:03:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 602. [2019-09-05 12:03:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-05 12:03:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 702 transitions. [2019-09-05 12:03:36,131 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 702 transitions. Word has length 300 [2019-09-05 12:03:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:36,131 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 702 transitions. [2019-09-05 12:03:36,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-05 12:03:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 702 transitions. [2019-09-05 12:03:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-05 12:03:36,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:36,133 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:36,133 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1097123420, now seen corresponding path program 44 times [2019-09-05 12:03:36,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:36,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:36,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:37,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:37,064 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-05 12:03:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:03:37,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:37,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:37,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-05 12:03:37,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:40,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11970 backedges. 0 proven. 11970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:40,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:40,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 149] total 151 [2019-09-05 12:03:40,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-05 12:03:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-05 12:03:40,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10741, Invalid=11909, Unknown=0, NotChecked=0, Total=22650 [2019-09-05 12:03:40,925 INFO L87 Difference]: Start difference. First operand 602 states and 702 transitions. Second operand 151 states. [2019-09-05 12:03:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:46,430 INFO L93 Difference]: Finished difference Result 748 states and 894 transitions. [2019-09-05 12:03:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-05 12:03:46,430 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 304 [2019-09-05 12:03:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:46,432 INFO L225 Difference]: With dead ends: 748 [2019-09-05 12:03:46,432 INFO L226 Difference]: Without dead ends: 742 [2019-09-05 12:03:46,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9584 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=10747, Invalid=12205, Unknown=0, NotChecked=0, Total=22952 [2019-09-05 12:03:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-05 12:03:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 604. [2019-09-05 12:03:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-05 12:03:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 704 transitions. [2019-09-05 12:03:46,439 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 704 transitions. Word has length 304 [2019-09-05 12:03:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:46,440 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 704 transitions. [2019-09-05 12:03:46,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-05 12:03:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 704 transitions. [2019-09-05 12:03:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-05 12:03:46,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:46,441 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:46,441 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1743488695, now seen corresponding path program 45 times [2019-09-05 12:03:46,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:46,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:46,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:46,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:46,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12062 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:47,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:47,457 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) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:47,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:47,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-05 12:03:47,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:47,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 12:03:47,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:47,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12062 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:03:47,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:47,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-05 12:03:47,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 12:03:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 12:03:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:03:47,811 INFO L87 Difference]: Start difference. First operand 604 states and 704 transitions. Second operand 53 states. [2019-09-05 12:03:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:48,323 INFO L93 Difference]: Finished difference Result 9916 states and 10016 transitions. [2019-09-05 12:03:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 12:03:48,324 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 306 [2019-09-05 12:03:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:48,330 INFO L225 Difference]: With dead ends: 9916 [2019-09-05 12:03:48,330 INFO L226 Difference]: Without dead ends: 9910 [2019-09-05 12:03:48,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 12:03:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9910 states. [2019-09-05 12:03:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9910 to 601. [2019-09-05 12:03:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-05 12:03:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 700 transitions. [2019-09-05 12:03:48,359 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 700 transitions. Word has length 306 [2019-09-05 12:03:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:48,360 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 700 transitions. [2019-09-05 12:03:48,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 12:03:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 700 transitions. [2019-09-05 12:03:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-05 12:03:48,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:48,361 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 48, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:48,361 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1669798739, now seen corresponding path program 46 times [2019-09-05 12:03:48,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:48,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:48,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11958 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:03:49,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:49,327 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) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:49,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:49,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:49,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:49,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-05 12:03:49,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:53,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11958 backedges. 0 proven. 11958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:53,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:53,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 150] total 153 [2019-09-05 12:03:53,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-05 12:03:53,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-05 12:03:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11036, Invalid=12220, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:03:53,197 INFO L87 Difference]: Start difference. First operand 601 states and 700 transitions. Second operand 153 states. [2019-09-05 12:03:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:59,025 INFO L93 Difference]: Finished difference Result 854 states and 1003 transitions. [2019-09-05 12:03:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-05 12:03:59,025 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 306 [2019-09-05 12:03:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:59,026 INFO L225 Difference]: With dead ends: 854 [2019-09-05 12:03:59,026 INFO L226 Difference]: Without dead ends: 846 [2019-09-05 12:03:59,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9988 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=11042, Invalid=12520, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 12:03:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-09-05 12:03:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 608. [2019-09-05 12:03:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-05 12:03:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 708 transitions. [2019-09-05 12:03:59,033 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 708 transitions. Word has length 306 [2019-09-05 12:03:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:59,034 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 708 transitions. [2019-09-05 12:03:59,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-05 12:03:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 708 transitions. [2019-09-05 12:03:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-05 12:03:59,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:59,035 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 49, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:59,036 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash 300726061, now seen corresponding path program 47 times [2019-09-05 12:03:59,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:59,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:04:00,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:00,897 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-05 12:04:00,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:01,158 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:04:01,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:01,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-05 12:04:01,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:04,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 12252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:04,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:04,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 152] total 154 [2019-09-05 12:04:04,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-05 12:04:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-05 12:04:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11185, Invalid=12377, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 12:04:04,826 INFO L87 Difference]: Start difference. First operand 608 states and 708 transitions. Second operand 154 states. [2019-09-05 12:04:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:11,127 INFO L93 Difference]: Finished difference Result 763 states and 912 transitions. [2019-09-05 12:04:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-05 12:04:11,128 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 310 [2019-09-05 12:04:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:11,129 INFO L225 Difference]: With dead ends: 763 [2019-09-05 12:04:11,130 INFO L226 Difference]: Without dead ends: 757 [2019-09-05 12:04:11,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10190 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=11191, Invalid=12679, Unknown=0, NotChecked=0, Total=23870 [2019-09-05 12:04:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-09-05 12:04:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 610. [2019-09-05 12:04:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-05 12:04:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 710 transitions. [2019-09-05 12:04:11,135 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 710 transitions. Word has length 310 [2019-09-05 12:04:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:11,136 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 710 transitions. [2019-09-05 12:04:11,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-05 12:04:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 710 transitions. [2019-09-05 12:04:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-05 12:04:11,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:11,138 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:11,138 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash 909805384, now seen corresponding path program 48 times [2019-09-05 12:04:11,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:11,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:11,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:11,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:11,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:04:12,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:12,256 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-05 12:04:12,268 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:12,544 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 99 check-sat command(s) [2019-09-05 12:04:12,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:12,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 12:04:12,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:12,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:04:12,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:12,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-05 12:04:12,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 12:04:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 12:04:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:04:12,643 INFO L87 Difference]: Start difference. First operand 610 states and 710 transitions. Second operand 56 states. [2019-09-05 12:04:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:13,197 INFO L93 Difference]: Finished difference Result 10516 states and 10616 transitions. [2019-09-05 12:04:13,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 12:04:13,198 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 312 [2019-09-05 12:04:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:13,204 INFO L225 Difference]: With dead ends: 10516 [2019-09-05 12:04:13,204 INFO L226 Difference]: Without dead ends: 10510 [2019-09-05 12:04:13,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:04:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10510 states. [2019-09-05 12:04:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10510 to 607. [2019-09-05 12:04:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-05 12:04:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 706 transitions. [2019-09-05 12:04:13,246 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 706 transitions. Word has length 312 [2019-09-05 12:04:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:13,247 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 706 transitions. [2019-09-05 12:04:13,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 12:04:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 706 transitions. [2019-09-05 12:04:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-05 12:04:13,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:13,250 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:13,250 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2050288450, now seen corresponding path program 49 times [2019-09-05 12:04:13,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:13,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:13,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:13,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:13,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:04:14,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:14,851 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-05 12:04:14,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:15,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-05 12:04:15,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:18,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12252 backedges. 0 proven. 12252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:18,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:18,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 153] total 156 [2019-09-05 12:04:18,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-05 12:04:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-05 12:04:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11486, Invalid=12694, Unknown=0, NotChecked=0, Total=24180 [2019-09-05 12:04:18,643 INFO L87 Difference]: Start difference. First operand 607 states and 706 transitions. Second operand 156 states. [2019-09-05 12:04:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:25,134 INFO L93 Difference]: Finished difference Result 875 states and 1027 transitions. [2019-09-05 12:04:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-05 12:04:25,134 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 312 [2019-09-05 12:04:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:25,136 INFO L225 Difference]: With dead ends: 875 [2019-09-05 12:04:25,136 INFO L226 Difference]: Without dead ends: 867 [2019-09-05 12:04:25,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10594 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=11492, Invalid=13000, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:04:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-09-05 12:04:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 614. [2019-09-05 12:04:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-05 12:04:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 714 transitions. [2019-09-05 12:04:25,143 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 714 transitions. Word has length 312 [2019-09-05 12:04:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:25,143 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 714 transitions. [2019-09-05 12:04:25,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-05 12:04:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 714 transitions. [2019-09-05 12:04:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-05 12:04:25,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:25,145 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:25,145 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:25,145 INFO L82 PathProgramCache]: Analyzing trace with hash 683083582, now seen corresponding path program 50 times [2019-09-05 12:04:25,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:25,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:25,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:25,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12552 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:04:26,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:26,332 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-05 12:04:26,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:26,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:26,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:26,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-05 12:04:26,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12552 backedges. 0 proven. 12552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 155] total 157 [2019-09-05 12:04:30,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-05 12:04:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-05 12:04:30,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11638, Invalid=12854, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:04:30,452 INFO L87 Difference]: Start difference. First operand 614 states and 714 transitions. Second operand 157 states. [2019-09-05 12:04:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:35,650 INFO L93 Difference]: Finished difference Result 778 states and 930 transitions. [2019-09-05 12:04:35,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-05 12:04:35,650 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 316 [2019-09-05 12:04:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:35,651 INFO L225 Difference]: With dead ends: 778 [2019-09-05 12:04:35,652 INFO L226 Difference]: Without dead ends: 772 [2019-09-05 12:04:35,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10796 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=11644, Invalid=13162, Unknown=0, NotChecked=0, Total=24806 [2019-09-05 12:04:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-05 12:04:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 616. [2019-09-05 12:04:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-05 12:04:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 716 transitions. [2019-09-05 12:04:35,659 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 716 transitions. Word has length 316 [2019-09-05 12:04:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:35,659 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 716 transitions. [2019-09-05 12:04:35,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-05 12:04:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 716 transitions. [2019-09-05 12:04:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-05 12:04:35,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:35,661 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 53, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:35,662 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1011804391, now seen corresponding path program 51 times [2019-09-05 12:04:35,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:35,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:35,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:04:36,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:36,921 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-05 12:04:36,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:37,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-05 12:04:37,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:37,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 12:04:37,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:37,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:04:37,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:37,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-05 12:04:37,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 12:04:37,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 12:04:37,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:04:37,207 INFO L87 Difference]: Start difference. First operand 616 states and 716 transitions. Second operand 59 states. [2019-09-05 12:04:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:37,803 INFO L93 Difference]: Finished difference Result 11116 states and 11216 transitions. [2019-09-05 12:04:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:04:37,803 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 318 [2019-09-05 12:04:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:37,810 INFO L225 Difference]: With dead ends: 11116 [2019-09-05 12:04:37,810 INFO L226 Difference]: Without dead ends: 11110 [2019-09-05 12:04:37,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:04:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-09-05 12:04:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 613. [2019-09-05 12:04:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-05 12:04:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 712 transitions. [2019-09-05 12:04:37,851 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 712 transitions. Word has length 318 [2019-09-05 12:04:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:37,851 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 712 transitions. [2019-09-05 12:04:37,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 12:04:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 712 transitions. [2019-09-05 12:04:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-05 12:04:37,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:37,854 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 54, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:37,854 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1476604943, now seen corresponding path program 52 times [2019-09-05 12:04:37,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:37,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:37,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12564 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:04:39,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:39,069 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-05 12:04:39,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:39,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:39,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:39,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-05 12:04:39,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:42,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12564 backedges. 0 proven. 12564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:42,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:42,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 156] total 159 [2019-09-05 12:04:42,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-05 12:04:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-05 12:04:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11945, Invalid=13177, Unknown=0, NotChecked=0, Total=25122 [2019-09-05 12:04:42,830 INFO L87 Difference]: Start difference. First operand 613 states and 712 transitions. Second operand 159 states. [2019-09-05 12:04:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:49,370 INFO L93 Difference]: Finished difference Result 896 states and 1051 transitions. [2019-09-05 12:04:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-05 12:04:49,371 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 318 [2019-09-05 12:04:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:49,373 INFO L225 Difference]: With dead ends: 896 [2019-09-05 12:04:49,373 INFO L226 Difference]: Without dead ends: 888 [2019-09-05 12:04:49,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11200 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=11951, Invalid=13489, Unknown=0, NotChecked=0, Total=25440 [2019-09-05 12:04:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-09-05 12:04:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 620. [2019-09-05 12:04:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-05 12:04:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 720 transitions. [2019-09-05 12:04:49,380 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 720 transitions. Word has length 318 [2019-09-05 12:04:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:49,381 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 720 transitions. [2019-09-05 12:04:49,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-05 12:04:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 720 transitions. [2019-09-05 12:04:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-05 12:04:49,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:49,383 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 55, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:49,383 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:49,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -170965361, now seen corresponding path program 53 times [2019-09-05 12:04:49,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:49,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:49,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12870 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:04:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:50,743 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-05 12:04:50,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:51,005 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:04:51,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:51,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-05 12:04:51,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:54,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12870 backedges. 0 proven. 12870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:04:54,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:54,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 158] total 160 [2019-09-05 12:04:54,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-05 12:04:54,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-05 12:04:54,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12100, Invalid=13340, Unknown=0, NotChecked=0, Total=25440 [2019-09-05 12:04:54,680 INFO L87 Difference]: Start difference. First operand 620 states and 720 transitions. Second operand 160 states. [2019-09-05 12:05:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:00,323 INFO L93 Difference]: Finished difference Result 793 states and 948 transitions. [2019-09-05 12:05:00,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-05 12:05:00,324 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 322 [2019-09-05 12:05:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:00,325 INFO L225 Difference]: With dead ends: 793 [2019-09-05 12:05:00,326 INFO L226 Difference]: Without dead ends: 787 [2019-09-05 12:05:00,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11402 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12106, Invalid=13654, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:05:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-05 12:05:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 622. [2019-09-05 12:05:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-05 12:05:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 722 transitions. [2019-09-05 12:05:00,332 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 722 transitions. Word has length 322 [2019-09-05 12:05:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:00,332 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 722 transitions. [2019-09-05 12:05:00,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-05 12:05:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 722 transitions. [2019-09-05 12:05:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-05 12:05:00,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:00,334 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 56, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:00,335 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1414085078, now seen corresponding path program 54 times [2019-09-05 12:05:00,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:00,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:00,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12980 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:05:01,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:01,736 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-05 12:05:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:02,031 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-05 12:05:02,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:02,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-05 12:05:02,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:05,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12980 backedges. 0 proven. 12980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:05,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:05,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 159] total 161 [2019-09-05 12:05:05,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-05 12:05:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-05 12:05:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12256, Invalid=13504, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:05:05,702 INFO L87 Difference]: Start difference. First operand 622 states and 722 transitions. Second operand 161 states. [2019-09-05 12:05:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:11,759 INFO L93 Difference]: Finished difference Result 798 states and 954 transitions. [2019-09-05 12:05:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-05 12:05:11,759 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 324 [2019-09-05 12:05:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:11,761 INFO L225 Difference]: With dead ends: 798 [2019-09-05 12:05:11,761 INFO L226 Difference]: Without dead ends: 792 [2019-09-05 12:05:11,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11604 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12262, Invalid=13820, Unknown=0, NotChecked=0, Total=26082 [2019-09-05 12:05:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-05 12:05:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 624. [2019-09-05 12:05:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-05 12:05:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 724 transitions. [2019-09-05 12:05:11,765 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 724 transitions. Word has length 324 [2019-09-05 12:05:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:11,766 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 724 transitions. [2019-09-05 12:05:11,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-05 12:05:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 724 transitions. [2019-09-05 12:05:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-05 12:05:11,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:11,768 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 57, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:11,768 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2051224827, now seen corresponding path program 55 times [2019-09-05 12:05:11,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:11,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:11,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:11,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:11,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13092 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:05:13,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:13,177 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-05 12:05:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:13,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-05 12:05:13,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:16,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13092 backedges. 0 proven. 13092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:16,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:16,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 160] total 162 [2019-09-05 12:05:16,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-05 12:05:16,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-05 12:05:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12413, Invalid=13669, Unknown=0, NotChecked=0, Total=26082 [2019-09-05 12:05:16,961 INFO L87 Difference]: Start difference. First operand 624 states and 724 transitions. Second operand 162 states. [2019-09-05 12:05:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:23,256 INFO L93 Difference]: Finished difference Result 803 states and 960 transitions. [2019-09-05 12:05:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-05 12:05:23,256 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 326 [2019-09-05 12:05:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:23,257 INFO L225 Difference]: With dead ends: 803 [2019-09-05 12:05:23,257 INFO L226 Difference]: Without dead ends: 797 [2019-09-05 12:05:23,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11806 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12419, Invalid=13987, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:05:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-05 12:05:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 626. [2019-09-05 12:05:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-05 12:05:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2019-09-05 12:05:23,262 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 326 [2019-09-05 12:05:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:23,262 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2019-09-05 12:05:23,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-05 12:05:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2019-09-05 12:05:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-05 12:05:23,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:23,264 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 58, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:23,264 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash -162200288, now seen corresponding path program 56 times [2019-09-05 12:05:23,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:23,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13206 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:05:24,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:24,620 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-05 12:05:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:24,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:24,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:24,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-05 12:05:24,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:28,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13206 backedges. 0 proven. 13206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:28,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:28,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 161] total 163 [2019-09-05 12:05:28,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-05 12:05:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-05 12:05:28,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12571, Invalid=13835, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:05:28,476 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 163 states. [2019-09-05 12:05:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:34,458 INFO L93 Difference]: Finished difference Result 808 states and 966 transitions. [2019-09-05 12:05:34,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-05 12:05:34,458 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 328 [2019-09-05 12:05:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:34,460 INFO L225 Difference]: With dead ends: 808 [2019-09-05 12:05:34,460 INFO L226 Difference]: Without dead ends: 802 [2019-09-05 12:05:34,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12008 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12577, Invalid=14155, Unknown=0, NotChecked=0, Total=26732 [2019-09-05 12:05:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-05 12:05:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 628. [2019-09-05 12:05:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-05 12:05:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 728 transitions. [2019-09-05 12:05:34,466 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 728 transitions. Word has length 328 [2019-09-05 12:05:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:34,466 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 728 transitions. [2019-09-05 12:05:34,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-05 12:05:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 728 transitions. [2019-09-05 12:05:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-05 12:05:34,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:34,468 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 59, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:34,468 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1580784517, now seen corresponding path program 57 times [2019-09-05 12:05:34,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:34,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13322 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:05:35,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:35,874 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-05 12:05:35,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:36,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-09-05 12:05:36,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:36,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 12:05:36,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:36,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13322 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:05:36,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:36,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-05 12:05:36,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 12:05:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 12:05:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:05:36,187 INFO L87 Difference]: Start difference. First operand 628 states and 728 transitions. Second operand 65 states. [2019-09-05 12:05:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:36,893 INFO L93 Difference]: Finished difference Result 12316 states and 12416 transitions. [2019-09-05 12:05:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 12:05:36,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 330 [2019-09-05 12:05:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:36,901 INFO L225 Difference]: With dead ends: 12316 [2019-09-05 12:05:36,901 INFO L226 Difference]: Without dead ends: 12310 [2019-09-05 12:05:36,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:05:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12310 states. [2019-09-05 12:05:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12310 to 625. [2019-09-05 12:05:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-05 12:05:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 724 transitions. [2019-09-05 12:05:36,933 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 724 transitions. Word has length 330 [2019-09-05 12:05:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:36,933 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 724 transitions. [2019-09-05 12:05:36,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 12:05:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 724 transitions. [2019-09-05 12:05:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-05 12:05:36,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:36,935 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 60, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:36,935 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:36,935 INFO L82 PathProgramCache]: Analyzing trace with hash -776503183, now seen corresponding path program 58 times [2019-09-05 12:05:36,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:36,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:36,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13242 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:05:38,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:38,348 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-05 12:05:38,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:38,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:38,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:38,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-05 12:05:38,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:42,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13242 backedges. 0 proven. 13242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:42,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:42,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 162] total 165 [2019-09-05 12:05:42,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-05 12:05:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-05 12:05:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12890, Invalid=14170, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:05:42,120 INFO L87 Difference]: Start difference. First operand 625 states and 724 transitions. Second operand 165 states. [2019-09-05 12:05:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:49,196 INFO L93 Difference]: Finished difference Result 938 states and 1099 transitions. [2019-09-05 12:05:49,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-05 12:05:49,196 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 330 [2019-09-05 12:05:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:49,197 INFO L225 Difference]: With dead ends: 938 [2019-09-05 12:05:49,198 INFO L226 Difference]: Without dead ends: 930 [2019-09-05 12:05:49,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12412 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12896, Invalid=14494, Unknown=0, NotChecked=0, Total=27390 [2019-09-05 12:05:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-09-05 12:05:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 632. [2019-09-05 12:05:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-05 12:05:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 732 transitions. [2019-09-05 12:05:49,204 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 732 transitions. Word has length 330 [2019-09-05 12:05:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:49,205 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 732 transitions. [2019-09-05 12:05:49,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-05 12:05:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 732 transitions. [2019-09-05 12:05:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-05 12:05:49,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:49,206 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 61, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:49,207 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1787047183, now seen corresponding path program 59 times [2019-09-05 12:05:49,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:49,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:49,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:49,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:49,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13560 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:05:50,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:50,758 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-05 12:05:50,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:51,038 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:05:51,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:51,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-05 12:05:51,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:54,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13560 backedges. 0 proven. 13560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:05:54,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:54,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 164] total 166 [2019-09-05 12:05:54,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-05 12:05:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-05 12:05:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2019-09-05 12:05:54,682 INFO L87 Difference]: Start difference. First operand 632 states and 732 transitions. Second operand 166 states. [2019-09-05 12:06:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:01,949 INFO L93 Difference]: Finished difference Result 823 states and 984 transitions. [2019-09-05 12:06:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-05 12:06:01,950 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 334 [2019-09-05 12:06:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:01,951 INFO L225 Difference]: With dead ends: 823 [2019-09-05 12:06:01,952 INFO L226 Difference]: Without dead ends: 817 [2019-09-05 12:06:01,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12614 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2019-09-05 12:06:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-09-05 12:06:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 634. [2019-09-05 12:06:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-05 12:06:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 734 transitions. [2019-09-05 12:06:01,959 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 734 transitions. Word has length 334 [2019-09-05 12:06:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:01,959 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 734 transitions. [2019-09-05 12:06:01,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-05 12:06:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 734 transitions. [2019-09-05 12:06:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-05 12:06:01,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:01,961 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 62, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:01,961 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:01,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:01,961 INFO L82 PathProgramCache]: Analyzing trace with hash 309445132, now seen corresponding path program 60 times [2019-09-05 12:06:01,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:01,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:01,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:01,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13682 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:06:03,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:03,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 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-05 12:06:03,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:03,798 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-05 12:06:03,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:03,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-05 12:06:03,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:07,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13682 backedges. 0 proven. 13682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:07,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:07,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 165] total 167 [2019-09-05 12:06:07,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-05 12:06:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-05 12:06:07,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13213, Invalid=14509, Unknown=0, NotChecked=0, Total=27722 [2019-09-05 12:06:07,474 INFO L87 Difference]: Start difference. First operand 634 states and 734 transitions. Second operand 167 states. [2019-09-05 12:06:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:14,313 INFO L93 Difference]: Finished difference Result 828 states and 990 transitions. [2019-09-05 12:06:14,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-05 12:06:14,314 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 336 [2019-09-05 12:06:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:14,315 INFO L225 Difference]: With dead ends: 828 [2019-09-05 12:06:14,315 INFO L226 Difference]: Without dead ends: 822 [2019-09-05 12:06:14,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12816 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=13219, Invalid=14837, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 12:06:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-09-05 12:06:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 636. [2019-09-05 12:06:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-05 12:06:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 736 transitions. [2019-09-05 12:06:14,322 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 736 transitions. Word has length 336 [2019-09-05 12:06:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:14,323 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 736 transitions. [2019-09-05 12:06:14,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-05 12:06:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 736 transitions. [2019-09-05 12:06:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-05 12:06:14,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:14,325 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 63, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:14,325 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash 698898023, now seen corresponding path program 61 times [2019-09-05 12:06:14,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:14,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:14,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:14,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:14,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:06:15,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:15,906 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-05 12:06:15,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:16,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-05 12:06:16,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:19,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:19,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:19,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 166] total 168 [2019-09-05 12:06:19,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-05 12:06:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-05 12:06:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 12:06:19,759 INFO L87 Difference]: Start difference. First operand 636 states and 736 transitions. Second operand 168 states. [2019-09-05 12:06:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:26,541 INFO L93 Difference]: Finished difference Result 833 states and 996 transitions. [2019-09-05 12:06:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-05 12:06:26,541 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 338 [2019-09-05 12:06:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:26,543 INFO L225 Difference]: With dead ends: 833 [2019-09-05 12:06:26,543 INFO L226 Difference]: Without dead ends: 827 [2019-09-05 12:06:26,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13018 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:06:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-09-05 12:06:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 638. [2019-09-05 12:06:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-05 12:06:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 738 transitions. [2019-09-05 12:06:26,549 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 738 transitions. Word has length 338 [2019-09-05 12:06:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:26,549 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 738 transitions. [2019-09-05 12:06:26,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-05 12:06:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 738 transitions. [2019-09-05 12:06:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-05 12:06:26,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:26,551 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 64, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:26,551 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1300971522, now seen corresponding path program 62 times [2019-09-05 12:06:26,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13932 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:06:28,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:28,240 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-05 12:06:28,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:28,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:28,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:28,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-05 12:06:28,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:31,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 13932 backedges. 0 proven. 13932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:32,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 167] total 169 [2019-09-05 12:06:32,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-05 12:06:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-05 12:06:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13540, Invalid=14852, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:06:32,030 INFO L87 Difference]: Start difference. First operand 638 states and 738 transitions. Second operand 169 states. [2019-09-05 12:06:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:40,708 INFO L93 Difference]: Finished difference Result 838 states and 1002 transitions. [2019-09-05 12:06:40,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-05 12:06:40,709 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 340 [2019-09-05 12:06:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:40,710 INFO L225 Difference]: With dead ends: 838 [2019-09-05 12:06:40,710 INFO L226 Difference]: Without dead ends: 832 [2019-09-05 12:06:40,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13220 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=13546, Invalid=15184, Unknown=0, NotChecked=0, Total=28730 [2019-09-05 12:06:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-09-05 12:06:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 640. [2019-09-05 12:06:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-05 12:06:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 740 transitions. [2019-09-05 12:06:40,716 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 740 transitions. Word has length 340 [2019-09-05 12:06:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:40,716 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 740 transitions. [2019-09-05 12:06:40,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-05 12:06:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 740 transitions. [2019-09-05 12:06:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-05 12:06:40,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:40,718 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 65, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:40,718 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:40,719 INFO L82 PathProgramCache]: Analyzing trace with hash 73019101, now seen corresponding path program 63 times [2019-09-05 12:06:40,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:40,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:40,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14060 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:06:42,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:42,508 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-05 12:06:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:42,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2019-09-05 12:06:42,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:42,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 12:06:42,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:42,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14060 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:06:42,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:42,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 71 [2019-09-05 12:06:42,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 12:06:42,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 12:06:42,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2221, Invalid=2749, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:06:42,863 INFO L87 Difference]: Start difference. First operand 640 states and 740 transitions. Second operand 71 states. [2019-09-05 12:06:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:43,762 INFO L93 Difference]: Finished difference Result 13516 states and 13616 transitions. [2019-09-05 12:06:43,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 12:06:43,762 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2019-09-05 12:06:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:43,770 INFO L225 Difference]: With dead ends: 13516 [2019-09-05 12:06:43,770 INFO L226 Difference]: Without dead ends: 13510 [2019-09-05 12:06:43,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2227, Invalid=2885, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 12:06:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13510 states. [2019-09-05 12:06:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13510 to 637. [2019-09-05 12:06:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-05 12:06:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 736 transitions. [2019-09-05 12:06:43,822 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 736 transitions. Word has length 342 [2019-09-05 12:06:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:43,822 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 736 transitions. [2019-09-05 12:06:43,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 12:06:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 736 transitions. [2019-09-05 12:06:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-05 12:06:43,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:43,825 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 66, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:43,825 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:43,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1853732397, now seen corresponding path program 64 times [2019-09-05 12:06:43,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:43,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:43,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:43,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:43,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13992 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:06:45,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:45,522 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-05 12:06:45,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:45,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:45,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:45,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-05 12:06:45,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:49,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 13992 backedges. 0 proven. 13992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:06:49,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:49,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 168] total 171 [2019-09-05 12:06:49,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-05 12:06:49,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-05 12:06:49,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13871, Invalid=15199, Unknown=0, NotChecked=0, Total=29070 [2019-09-05 12:06:49,348 INFO L87 Difference]: Start difference. First operand 637 states and 736 transitions. Second operand 171 states. [2019-09-05 12:06:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:58,930 INFO L93 Difference]: Finished difference Result 980 states and 1147 transitions. [2019-09-05 12:06:58,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-05 12:06:58,930 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 342 [2019-09-05 12:06:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:58,932 INFO L225 Difference]: With dead ends: 980 [2019-09-05 12:06:58,932 INFO L226 Difference]: Without dead ends: 972 [2019-09-05 12:06:58,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13624 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=13877, Invalid=15535, Unknown=0, NotChecked=0, Total=29412 [2019-09-05 12:06:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-09-05 12:06:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 644. [2019-09-05 12:06:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-05 12:06:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 744 transitions. [2019-09-05 12:06:58,943 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 744 transitions. Word has length 342 [2019-09-05 12:06:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:58,943 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 744 transitions. [2019-09-05 12:06:58,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-05 12:06:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 744 transitions. [2019-09-05 12:06:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-05 12:06:58,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:58,947 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 67, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:58,947 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash 148823123, now seen corresponding path program 65 times [2019-09-05 12:06:58,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:58,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:58,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14322 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:07:00,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:00,712 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-05 12:07:00,722 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:07:01,002 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:07:01,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:01,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 172 conjunts are in the unsatisfiable core [2019-09-05 12:07:01,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:04,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14322 backedges. 0 proven. 14322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:04,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:04,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 170] total 172 [2019-09-05 12:07:04,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-05 12:07:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-05 12:07:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14038, Invalid=15374, Unknown=0, NotChecked=0, Total=29412 [2019-09-05 12:07:04,619 INFO L87 Difference]: Start difference. First operand 644 states and 744 transitions. Second operand 172 states. [2019-09-05 12:07:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:13,080 INFO L93 Difference]: Finished difference Result 853 states and 1020 transitions. [2019-09-05 12:07:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-05 12:07:13,080 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 346 [2019-09-05 12:07:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:13,082 INFO L225 Difference]: With dead ends: 853 [2019-09-05 12:07:13,082 INFO L226 Difference]: Without dead ends: 847 [2019-09-05 12:07:13,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13826 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=14044, Invalid=15712, Unknown=0, NotChecked=0, Total=29756 [2019-09-05 12:07:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-05 12:07:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 646. [2019-09-05 12:07:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-05 12:07:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 746 transitions. [2019-09-05 12:07:13,088 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 746 transitions. Word has length 346 [2019-09-05 12:07:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:13,089 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 746 transitions. [2019-09-05 12:07:13,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-05 12:07:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 746 transitions. [2019-09-05 12:07:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-05 12:07:13,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:13,091 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 68, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:13,091 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash 959970030, now seen corresponding path program 66 times [2019-09-05 12:07:13,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:13,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:13,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14456 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:07:14,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:14,878 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-05 12:07:14,889 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:07:15,184 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-05 12:07:15,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:15,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-05 12:07:15,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:18,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14456 backedges. 0 proven. 14456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:18,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 171] total 173 [2019-09-05 12:07:18,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 173 states [2019-09-05 12:07:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2019-09-05 12:07:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14206, Invalid=15550, Unknown=0, NotChecked=0, Total=29756 [2019-09-05 12:07:18,807 INFO L87 Difference]: Start difference. First operand 646 states and 746 transitions. Second operand 173 states. [2019-09-05 12:07:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:27,614 INFO L93 Difference]: Finished difference Result 858 states and 1026 transitions. [2019-09-05 12:07:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-05 12:07:27,614 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 348 [2019-09-05 12:07:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:27,615 INFO L225 Difference]: With dead ends: 858 [2019-09-05 12:07:27,616 INFO L226 Difference]: Without dead ends: 852 [2019-09-05 12:07:27,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14028 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14212, Invalid=15890, Unknown=0, NotChecked=0, Total=30102 [2019-09-05 12:07:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-09-05 12:07:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 648. [2019-09-05 12:07:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-05 12:07:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 748 transitions. [2019-09-05 12:07:27,622 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 748 transitions. Word has length 348 [2019-09-05 12:07:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:27,622 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 748 transitions. [2019-09-05 12:07:27,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 173 states. [2019-09-05 12:07:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 748 transitions. [2019-09-05 12:07:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-05 12:07:27,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:27,624 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 69, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:27,624 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1211900215, now seen corresponding path program 67 times [2019-09-05 12:07:27,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:27,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:27,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14592 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:07:29,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:29,406 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-05 12:07:29,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:29,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 174 conjunts are in the unsatisfiable core [2019-09-05 12:07:29,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:33,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14592 backedges. 0 proven. 14592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:33,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:33,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 172] total 174 [2019-09-05 12:07:33,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-05 12:07:33,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-05 12:07:33,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14375, Invalid=15727, Unknown=0, NotChecked=0, Total=30102 [2019-09-05 12:07:33,192 INFO L87 Difference]: Start difference. First operand 648 states and 748 transitions. Second operand 174 states. [2019-09-05 12:07:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:40,991 INFO L93 Difference]: Finished difference Result 863 states and 1032 transitions. [2019-09-05 12:07:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-05 12:07:40,991 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 350 [2019-09-05 12:07:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:40,992 INFO L225 Difference]: With dead ends: 863 [2019-09-05 12:07:40,993 INFO L226 Difference]: Without dead ends: 857 [2019-09-05 12:07:40,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14230 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14381, Invalid=16069, Unknown=0, NotChecked=0, Total=30450 [2019-09-05 12:07:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-05 12:07:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 650. [2019-09-05 12:07:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-05 12:07:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 750 transitions. [2019-09-05 12:07:40,999 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 750 transitions. Word has length 350 [2019-09-05 12:07:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:40,999 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 750 transitions. [2019-09-05 12:07:40,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-05 12:07:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 750 transitions. [2019-09-05 12:07:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-05 12:07:41,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:41,001 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 70, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:41,001 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1025099804, now seen corresponding path program 68 times [2019-09-05 12:07:41,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:41,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:41,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14730 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:07:42,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:42,962 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-05 12:07:42,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:43,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:43,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:43,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-05 12:07:43,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14730 backedges. 0 proven. 14730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:07:46,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:46,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 173] total 175 [2019-09-05 12:07:46,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-05 12:07:46,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-05 12:07:46,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14545, Invalid=15905, Unknown=0, NotChecked=0, Total=30450 [2019-09-05 12:07:46,785 INFO L87 Difference]: Start difference. First operand 650 states and 750 transitions. Second operand 175 states. [2019-09-05 12:07:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:55,788 INFO L93 Difference]: Finished difference Result 868 states and 1038 transitions. [2019-09-05 12:07:55,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-05 12:07:55,789 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 352 [2019-09-05 12:07:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:55,790 INFO L225 Difference]: With dead ends: 868 [2019-09-05 12:07:55,790 INFO L226 Difference]: Without dead ends: 862 [2019-09-05 12:07:55,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14432 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=14551, Invalid=16249, Unknown=0, NotChecked=0, Total=30800 [2019-09-05 12:07:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-05 12:07:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 652. [2019-09-05 12:07:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-05 12:07:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 752 transitions. [2019-09-05 12:07:55,796 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 752 transitions. Word has length 352 [2019-09-05 12:07:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:55,796 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 752 transitions. [2019-09-05 12:07:55,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-05 12:07:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 752 transitions. [2019-09-05 12:07:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-05 12:07:55,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:55,798 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 71, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:55,798 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1898531265, now seen corresponding path program 69 times [2019-09-05 12:07:55,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:55,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:55,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14870 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:07:57,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:57,721 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-05 12:07:57,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:07:57,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2019-09-05 12:07:57,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:57,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 12:07:57,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14870 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:07:58,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:58,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 77 [2019-09-05 12:07:58,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 12:07:58,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 12:07:58,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2638, Invalid=3214, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:07:58,097 INFO L87 Difference]: Start difference. First operand 652 states and 752 transitions. Second operand 77 states. [2019-09-05 12:07:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:59,217 INFO L93 Difference]: Finished difference Result 14716 states and 14816 transitions. [2019-09-05 12:07:59,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 12:07:59,217 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 354 [2019-09-05 12:07:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:59,226 INFO L225 Difference]: With dead ends: 14716 [2019-09-05 12:07:59,226 INFO L226 Difference]: Without dead ends: 14710 [2019-09-05 12:07:59,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2644, Invalid=3362, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:07:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14710 states. [2019-09-05 12:07:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14710 to 649. [2019-09-05 12:07:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-09-05 12:07:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 748 transitions. [2019-09-05 12:07:59,262 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 748 transitions. Word has length 354 [2019-09-05 12:07:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:59,262 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 748 transitions. [2019-09-05 12:07:59,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 12:07:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 748 transitions. [2019-09-05 12:07:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-05 12:07:59,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:59,264 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 72, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:59,264 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 546312245, now seen corresponding path program 70 times [2019-09-05 12:07:59,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:59,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:59,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:59,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:59,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 14814 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:08:01,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:01,219 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-05 12:08:01,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:08:01,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:08:01,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:01,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 176 conjunts are in the unsatisfiable core [2019-09-05 12:08:01,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:05,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14814 backedges. 0 proven. 14814 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:05,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:05,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 174] total 177 [2019-09-05 12:08:05,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-05 12:08:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-05 12:08:05,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14888, Invalid=16264, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:08:05,163 INFO L87 Difference]: Start difference. First operand 649 states and 748 transitions. Second operand 177 states. [2019-09-05 12:08:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:13,365 INFO L93 Difference]: Finished difference Result 1022 states and 1195 transitions. [2019-09-05 12:08:13,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-05 12:08:13,365 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 354 [2019-09-05 12:08:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:13,367 INFO L225 Difference]: With dead ends: 1022 [2019-09-05 12:08:13,367 INFO L226 Difference]: Without dead ends: 1014 [2019-09-05 12:08:13,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14836 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=14894, Invalid=16612, Unknown=0, NotChecked=0, Total=31506 [2019-09-05 12:08:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-09-05 12:08:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 656. [2019-09-05 12:08:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-05 12:08:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 756 transitions. [2019-09-05 12:08:13,373 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 756 transitions. Word has length 354 [2019-09-05 12:08:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:13,374 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 756 transitions. [2019-09-05 12:08:13,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-05 12:08:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 756 transitions. [2019-09-05 12:08:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-05 12:08:13,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:13,376 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 73, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:13,376 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1764025013, now seen corresponding path program 71 times [2019-09-05 12:08:13,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:13,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:13,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:13,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:13,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15156 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:08:15,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:15,417 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-05 12:08:15,427 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:08:15,721 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:08:15,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:15,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 178 conjunts are in the unsatisfiable core [2019-09-05 12:08:15,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:19,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15156 backedges. 0 proven. 15156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:19,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:19,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 176] total 178 [2019-09-05 12:08:19,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-05 12:08:19,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-05 12:08:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15061, Invalid=16445, Unknown=0, NotChecked=0, Total=31506 [2019-09-05 12:08:19,383 INFO L87 Difference]: Start difference. First operand 656 states and 756 transitions. Second operand 178 states. [2019-09-05 12:08:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:30,288 INFO L93 Difference]: Finished difference Result 883 states and 1056 transitions. [2019-09-05 12:08:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-05 12:08:30,288 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 358 [2019-09-05 12:08:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:30,290 INFO L225 Difference]: With dead ends: 883 [2019-09-05 12:08:30,290 INFO L226 Difference]: Without dead ends: 877 [2019-09-05 12:08:30,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15038 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=15067, Invalid=16795, Unknown=0, NotChecked=0, Total=31862 [2019-09-05 12:08:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-09-05 12:08:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 658. [2019-09-05 12:08:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-05 12:08:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 758 transitions. [2019-09-05 12:08:30,295 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 758 transitions. Word has length 358 [2019-09-05 12:08:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:30,295 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 758 transitions. [2019-09-05 12:08:30,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-05 12:08:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 758 transitions. [2019-09-05 12:08:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-05 12:08:30,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:30,297 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 74, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:30,297 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1609174832, now seen corresponding path program 72 times [2019-09-05 12:08:30,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:30,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:30,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15302 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:08:32,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:32,461 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-05 12:08:32,474 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:08:32,778 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-05 12:08:32,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:32,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 179 conjunts are in the unsatisfiable core [2019-09-05 12:08:32,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15302 backedges. 0 proven. 15302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:36,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:36,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 177] total 179 [2019-09-05 12:08:36,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 179 states [2019-09-05 12:08:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2019-09-05 12:08:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15235, Invalid=16627, Unknown=0, NotChecked=0, Total=31862 [2019-09-05 12:08:36,432 INFO L87 Difference]: Start difference. First operand 658 states and 758 transitions. Second operand 179 states. [2019-09-05 12:08:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:47,380 INFO L93 Difference]: Finished difference Result 888 states and 1062 transitions. [2019-09-05 12:08:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-09-05 12:08:47,381 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 360 [2019-09-05 12:08:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:47,382 INFO L225 Difference]: With dead ends: 888 [2019-09-05 12:08:47,382 INFO L226 Difference]: Without dead ends: 882 [2019-09-05 12:08:47,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15240 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=15241, Invalid=16979, Unknown=0, NotChecked=0, Total=32220 [2019-09-05 12:08:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-09-05 12:08:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 660. [2019-09-05 12:08:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-05 12:08:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 760 transitions. [2019-09-05 12:08:47,389 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 760 transitions. Word has length 360 [2019-09-05 12:08:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:47,389 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 760 transitions. [2019-09-05 12:08:47,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 179 states. [2019-09-05 12:08:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 760 transitions. [2019-09-05 12:08:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-05 12:08:47,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:47,391 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 75, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:47,391 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -553917397, now seen corresponding path program 73 times [2019-09-05 12:08:47,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:47,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:47,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15450 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:08:49,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:49,646 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-05 12:08:49,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:49,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 180 conjunts are in the unsatisfiable core [2019-09-05 12:08:49,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:53,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15450 backedges. 0 proven. 15450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:08:53,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:53,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 178] total 180 [2019-09-05 12:08:53,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-09-05 12:08:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-09-05 12:08:53,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15410, Invalid=16810, Unknown=0, NotChecked=0, Total=32220 [2019-09-05 12:08:53,455 INFO L87 Difference]: Start difference. First operand 660 states and 760 transitions. Second operand 180 states. [2019-09-05 12:09:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:04,971 INFO L93 Difference]: Finished difference Result 893 states and 1068 transitions. [2019-09-05 12:09:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-05 12:09:04,972 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 362 [2019-09-05 12:09:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:04,973 INFO L225 Difference]: With dead ends: 893 [2019-09-05 12:09:04,973 INFO L226 Difference]: Without dead ends: 887 [2019-09-05 12:09:04,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15442 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=15416, Invalid=17164, Unknown=0, NotChecked=0, Total=32580 [2019-09-05 12:09:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-05 12:09:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 662. [2019-09-05 12:09:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-05 12:09:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 762 transitions. [2019-09-05 12:09:04,979 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 762 transitions. Word has length 362 [2019-09-05 12:09:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:04,980 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 762 transitions. [2019-09-05 12:09:04,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-09-05 12:09:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 762 transitions. [2019-09-05 12:09:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-05 12:09:04,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:04,982 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 76, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:04,982 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash -63804218, now seen corresponding path program 74 times [2019-09-05 12:09:04,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:04,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:04,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15600 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:09:07,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:07,178 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-05 12:09:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:09:07,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:09:07,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:07,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 181 conjunts are in the unsatisfiable core [2019-09-05 12:09:07,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:10,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15600 backedges. 0 proven. 15600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:11,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:11,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 179] total 181 [2019-09-05 12:09:11,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 181 states [2019-09-05 12:09:11,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2019-09-05 12:09:11,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15586, Invalid=16994, Unknown=0, NotChecked=0, Total=32580 [2019-09-05 12:09:11,026 INFO L87 Difference]: Start difference. First operand 662 states and 762 transitions. Second operand 181 states. [2019-09-05 12:09:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:22,315 INFO L93 Difference]: Finished difference Result 898 states and 1074 transitions. [2019-09-05 12:09:22,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-09-05 12:09:22,315 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 364 [2019-09-05 12:09:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:22,316 INFO L225 Difference]: With dead ends: 898 [2019-09-05 12:09:22,316 INFO L226 Difference]: Without dead ends: 892 [2019-09-05 12:09:22,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15644 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=15592, Invalid=17350, Unknown=0, NotChecked=0, Total=32942 [2019-09-05 12:09:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-09-05 12:09:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 664. [2019-09-05 12:09:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-05 12:09:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 764 transitions. [2019-09-05 12:09:22,322 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 764 transitions. Word has length 364 [2019-09-05 12:09:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:22,323 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 764 transitions. [2019-09-05 12:09:22,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 181 states. [2019-09-05 12:09:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 764 transitions. [2019-09-05 12:09:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-05 12:09:22,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:22,325 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 77, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:22,325 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1511441759, now seen corresponding path program 75 times [2019-09-05 12:09:22,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:22,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:22,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:22,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:22,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15752 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:09:24,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:24,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:24,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:09:24,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2019-09-05 12:09:24,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:24,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 12:09:24,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:24,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15752 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:09:25,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:25,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 83 [2019-09-05 12:09:25,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 12:09:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 12:09:25,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3091, Invalid=3715, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:09:25,069 INFO L87 Difference]: Start difference. First operand 664 states and 764 transitions. Second operand 83 states. [2019-09-05 12:09:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:26,334 INFO L93 Difference]: Finished difference Result 15916 states and 16016 transitions. [2019-09-05 12:09:26,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 12:09:26,335 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 366 [2019-09-05 12:09:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:26,343 INFO L225 Difference]: With dead ends: 15916 [2019-09-05 12:09:26,344 INFO L226 Difference]: Without dead ends: 15910 [2019-09-05 12:09:26,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3097, Invalid=3875, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:09:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15910 states. [2019-09-05 12:09:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15910 to 661. [2019-09-05 12:09:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-05 12:09:26,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 760 transitions. [2019-09-05 12:09:26,391 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 760 transitions. Word has length 366 [2019-09-05 12:09:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:26,392 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 760 transitions. [2019-09-05 12:09:26,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 12:09:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 760 transitions. [2019-09-05 12:09:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-05 12:09:26,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:26,394 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 78, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:26,395 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash 692933527, now seen corresponding path program 76 times [2019-09-05 12:09:26,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:26,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:26,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15708 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:09:28,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:28,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:09:28,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:09:28,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:28,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 182 conjunts are in the unsatisfiable core [2019-09-05 12:09:28,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:32,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15708 backedges. 0 proven. 15708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:32,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:32,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 180] total 183 [2019-09-05 12:09:32,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 183 states [2019-09-05 12:09:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2019-09-05 12:09:32,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15941, Invalid=17365, Unknown=0, NotChecked=0, Total=33306 [2019-09-05 12:09:32,504 INFO L87 Difference]: Start difference. First operand 661 states and 760 transitions. Second operand 183 states. [2019-09-05 12:09:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:41,991 INFO L93 Difference]: Finished difference Result 1064 states and 1243 transitions. [2019-09-05 12:09:41,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-09-05 12:09:41,992 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 366 [2019-09-05 12:09:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:41,994 INFO L225 Difference]: With dead ends: 1064 [2019-09-05 12:09:41,994 INFO L226 Difference]: Without dead ends: 1056 [2019-09-05 12:09:41,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16048 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=15947, Invalid=17725, Unknown=0, NotChecked=0, Total=33672 [2019-09-05 12:09:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-09-05 12:09:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 668. [2019-09-05 12:09:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-05 12:09:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 768 transitions. [2019-09-05 12:09:42,000 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 768 transitions. Word has length 366 [2019-09-05 12:09:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:42,001 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 768 transitions. [2019-09-05 12:09:42,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 183 states. [2019-09-05 12:09:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 768 transitions. [2019-09-05 12:09:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-05 12:09:42,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:42,003 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 79, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:42,003 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:42,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:42,003 INFO L82 PathProgramCache]: Analyzing trace with hash -256219625, now seen corresponding path program 77 times [2019-09-05 12:09:42,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:42,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:42,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:42,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:42,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16062 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:09:44,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:44,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:44,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:09:44,813 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:09:44,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:44,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 184 conjunts are in the unsatisfiable core [2019-09-05 12:09:44,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16062 backedges. 0 proven. 16062 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:09:48,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:48,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 182] total 184 [2019-09-05 12:09:48,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-09-05 12:09:48,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-09-05 12:09:48,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16120, Invalid=17552, Unknown=0, NotChecked=0, Total=33672 [2019-09-05 12:09:48,452 INFO L87 Difference]: Start difference. First operand 668 states and 768 transitions. Second operand 184 states. [2019-09-05 12:09:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:58,001 INFO L93 Difference]: Finished difference Result 913 states and 1092 transitions. [2019-09-05 12:09:58,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2019-09-05 12:09:58,001 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 370 [2019-09-05 12:09:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:58,003 INFO L225 Difference]: With dead ends: 913 [2019-09-05 12:09:58,003 INFO L226 Difference]: Without dead ends: 907 [2019-09-05 12:09:58,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16250 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=16126, Invalid=17914, Unknown=0, NotChecked=0, Total=34040 [2019-09-05 12:09:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-09-05 12:09:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 670. [2019-09-05 12:09:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-05 12:09:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 770 transitions. [2019-09-05 12:09:58,010 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 770 transitions. Word has length 370 [2019-09-05 12:09:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:58,010 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 770 transitions. [2019-09-05 12:09:58,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-09-05 12:09:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 770 transitions. [2019-09-05 12:09:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-05 12:09:58,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:58,012 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 80, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:58,012 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1739054158, now seen corresponding path program 78 times [2019-09-05 12:09:58,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:58,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:58,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16220 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:10:00,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:00,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:00,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:00,844 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-05 12:10:00,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:00,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 185 conjunts are in the unsatisfiable core [2019-09-05 12:10:00,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:04,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16220 backedges. 0 proven. 16220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:04,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:04,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 183] total 185 [2019-09-05 12:10:04,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 185 states [2019-09-05 12:10:04,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2019-09-05 12:10:04,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16300, Invalid=17740, Unknown=0, NotChecked=0, Total=34040 [2019-09-05 12:10:04,538 INFO L87 Difference]: Start difference. First operand 670 states and 770 transitions. Second operand 185 states. [2019-09-05 12:10:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:16,272 INFO L93 Difference]: Finished difference Result 918 states and 1098 transitions. [2019-09-05 12:10:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-09-05 12:10:16,272 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 372 [2019-09-05 12:10:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:16,273 INFO L225 Difference]: With dead ends: 918 [2019-09-05 12:10:16,273 INFO L226 Difference]: Without dead ends: 912 [2019-09-05 12:10:16,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16452 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=16306, Invalid=18104, Unknown=0, NotChecked=0, Total=34410 [2019-09-05 12:10:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-05 12:10:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 672. [2019-09-05 12:10:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-09-05 12:10:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 772 transitions. [2019-09-05 12:10:16,279 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 772 transitions. Word has length 372 [2019-09-05 12:10:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:16,279 INFO L475 AbstractCegarLoop]: Abstraction has 672 states and 772 transitions. [2019-09-05 12:10:16,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 185 states. [2019-09-05 12:10:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 772 transitions. [2019-09-05 12:10:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-05 12:10:16,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:16,282 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 81, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:16,282 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:16,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash -813898099, now seen corresponding path program 79 times [2019-09-05 12:10:16,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:16,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:10:18,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:18,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:18,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 186 conjunts are in the unsatisfiable core [2019-09-05 12:10:18,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:22,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 16380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:22,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:22,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 184] total 186 [2019-09-05 12:10:22,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-09-05 12:10:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-09-05 12:10:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16481, Invalid=17929, Unknown=0, NotChecked=0, Total=34410 [2019-09-05 12:10:22,642 INFO L87 Difference]: Start difference. First operand 672 states and 772 transitions. Second operand 186 states. [2019-09-05 12:10:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:36,245 INFO L93 Difference]: Finished difference Result 923 states and 1104 transitions. [2019-09-05 12:10:36,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-09-05 12:10:36,245 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 374 [2019-09-05 12:10:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:36,247 INFO L225 Difference]: With dead ends: 923 [2019-09-05 12:10:36,247 INFO L226 Difference]: Without dead ends: 917 [2019-09-05 12:10:36,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16654 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=16487, Invalid=18295, Unknown=0, NotChecked=0, Total=34782 [2019-09-05 12:10:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-05 12:10:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 674. [2019-09-05 12:10:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-05 12:10:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 774 transitions. [2019-09-05 12:10:36,254 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 774 transitions. Word has length 374 [2019-09-05 12:10:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:36,254 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 774 transitions. [2019-09-05 12:10:36,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-09-05 12:10:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 774 transitions. [2019-09-05 12:10:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-05 12:10:36,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:36,256 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 82, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:36,256 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:36,257 INFO L82 PathProgramCache]: Analyzing trace with hash -797155672, now seen corresponding path program 80 times [2019-09-05 12:10:36,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:36,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:36,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 16542 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:10:38,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:38,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:38,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:10:38,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:10:38,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:38,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 187 conjunts are in the unsatisfiable core [2019-09-05 12:10:38,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:42,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16542 backedges. 0 proven. 16542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:10:42,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:42,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 185] total 187 [2019-09-05 12:10:42,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 187 states [2019-09-05 12:10:42,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2019-09-05 12:10:42,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16663, Invalid=18119, Unknown=0, NotChecked=0, Total=34782 [2019-09-05 12:10:42,632 INFO L87 Difference]: Start difference. First operand 674 states and 774 transitions. Second operand 187 states. [2019-09-05 12:10:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:53,295 INFO L93 Difference]: Finished difference Result 928 states and 1110 transitions. [2019-09-05 12:10:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-09-05 12:10:53,295 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 376 [2019-09-05 12:10:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:53,297 INFO L225 Difference]: With dead ends: 928 [2019-09-05 12:10:53,297 INFO L226 Difference]: Without dead ends: 922 [2019-09-05 12:10:53,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16856 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=16669, Invalid=18487, Unknown=0, NotChecked=0, Total=35156 [2019-09-05 12:10:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-09-05 12:10:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 676. [2019-09-05 12:10:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-05 12:10:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 776 transitions. [2019-09-05 12:10:53,304 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 776 transitions. Word has length 376 [2019-09-05 12:10:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:53,304 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 776 transitions. [2019-09-05 12:10:53,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 187 states. [2019-09-05 12:10:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 776 transitions. [2019-09-05 12:10:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-05 12:10:53,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:53,307 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 83, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:53,307 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1887552509, now seen corresponding path program 81 times [2019-09-05 12:10:53,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:53,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16706 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:10:55,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:55,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:55,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:10:56,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2019-09-05 12:10:56,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:56,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 12:10:56,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:56,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16706 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:10:56,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:56,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 89 [2019-09-05 12:10:56,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 12:10:56,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 12:10:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3580, Invalid=4252, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:10:56,413 INFO L87 Difference]: Start difference. First operand 676 states and 776 transitions. Second operand 89 states. [2019-09-05 12:10:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:58,072 INFO L93 Difference]: Finished difference Result 17116 states and 17216 transitions. [2019-09-05 12:10:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 12:10:58,073 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 378 [2019-09-05 12:10:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:58,081 INFO L225 Difference]: With dead ends: 17116 [2019-09-05 12:10:58,081 INFO L226 Difference]: Without dead ends: 17110 [2019-09-05 12:10:58,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3586, Invalid=4424, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:10:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17110 states. [2019-09-05 12:10:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17110 to 673. [2019-09-05 12:10:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-05 12:10:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 772 transitions. [2019-09-05 12:10:58,128 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 772 transitions. Word has length 378 [2019-09-05 12:10:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:58,129 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 772 transitions. [2019-09-05 12:10:58,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 12:10:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 772 transitions. [2019-09-05 12:10:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-05 12:10:58,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:58,131 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 84, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:58,131 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1754885127, now seen corresponding path program 82 times [2019-09-05 12:10:58,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:58,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:58,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16674 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:11:00,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:00,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:00,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:11:00,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:11:00,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:00,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 188 conjunts are in the unsatisfiable core [2019-09-05 12:11:00,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:04,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16674 backedges. 0 proven. 16674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:04,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:04,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 186] total 189 [2019-09-05 12:11:04,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 189 states [2019-09-05 12:11:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2019-09-05 12:11:04,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17030, Invalid=18502, Unknown=0, NotChecked=0, Total=35532 [2019-09-05 12:11:04,727 INFO L87 Difference]: Start difference. First operand 673 states and 772 transitions. Second operand 189 states. [2019-09-05 12:11:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:16,753 INFO L93 Difference]: Finished difference Result 1106 states and 1291 transitions. [2019-09-05 12:11:16,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-09-05 12:11:16,753 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 378 [2019-09-05 12:11:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:16,755 INFO L225 Difference]: With dead ends: 1106 [2019-09-05 12:11:16,755 INFO L226 Difference]: Without dead ends: 1098 [2019-09-05 12:11:16,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17260 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=17036, Invalid=18874, Unknown=0, NotChecked=0, Total=35910 [2019-09-05 12:11:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-05 12:11:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 680. [2019-09-05 12:11:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-05 12:11:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 780 transitions. [2019-09-05 12:11:16,762 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 780 transitions. Word has length 378 [2019-09-05 12:11:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:16,763 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 780 transitions. [2019-09-05 12:11:16,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 189 states. [2019-09-05 12:11:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 780 transitions. [2019-09-05 12:11:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-05 12:11:16,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:16,765 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 85, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:16,765 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 457959033, now seen corresponding path program 83 times [2019-09-05 12:11:16,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:16,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:16,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17040 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:11:19,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:19,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:19,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:11:19,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:11:19,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:19,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 190 conjunts are in the unsatisfiable core [2019-09-05 12:11:19,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:23,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17040 backedges. 0 proven. 17040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:23,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:23,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 188] total 190 [2019-09-05 12:11:23,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-09-05 12:11:23,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-09-05 12:11:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17215, Invalid=18695, Unknown=0, NotChecked=0, Total=35910 [2019-09-05 12:11:23,605 INFO L87 Difference]: Start difference. First operand 680 states and 780 transitions. Second operand 190 states. [2019-09-05 12:11:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:35,202 INFO L93 Difference]: Finished difference Result 943 states and 1128 transitions. [2019-09-05 12:11:35,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2019-09-05 12:11:35,203 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 382 [2019-09-05 12:11:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:35,204 INFO L225 Difference]: With dead ends: 943 [2019-09-05 12:11:35,204 INFO L226 Difference]: Without dead ends: 937 [2019-09-05 12:11:35,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17462 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=17221, Invalid=19069, Unknown=0, NotChecked=0, Total=36290 [2019-09-05 12:11:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-05 12:11:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 682. [2019-09-05 12:11:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-05 12:11:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 782 transitions. [2019-09-05 12:11:35,210 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 782 transitions. Word has length 382 [2019-09-05 12:11:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:35,211 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 782 transitions. [2019-09-05 12:11:35,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-09-05 12:11:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 782 transitions. [2019-09-05 12:11:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-05 12:11:35,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:35,213 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 86, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:35,213 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1686836116, now seen corresponding path program 84 times [2019-09-05 12:11:35,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:35,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:35,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:35,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:35,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17210 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:11:38,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:38,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:38,064 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:11:38,404 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-05 12:11:38,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:38,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 191 conjunts are in the unsatisfiable core [2019-09-05 12:11:38,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17210 backedges. 0 proven. 17210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:11:42,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:42,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 189] total 191 [2019-09-05 12:11:42,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 191 states [2019-09-05 12:11:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2019-09-05 12:11:42,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17401, Invalid=18889, Unknown=0, NotChecked=0, Total=36290 [2019-09-05 12:11:42,092 INFO L87 Difference]: Start difference. First operand 682 states and 782 transitions. Second operand 191 states. [2019-09-05 12:11:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:56,856 INFO L93 Difference]: Finished difference Result 948 states and 1134 transitions. [2019-09-05 12:11:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-05 12:11:56,856 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 384 [2019-09-05 12:11:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:56,858 INFO L225 Difference]: With dead ends: 948 [2019-09-05 12:11:56,858 INFO L226 Difference]: Without dead ends: 942 [2019-09-05 12:11:56,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17664 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=17407, Invalid=19265, Unknown=0, NotChecked=0, Total=36672 [2019-09-05 12:11:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-05 12:11:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 684. [2019-09-05 12:11:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-05 12:11:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 784 transitions. [2019-09-05 12:11:56,864 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 784 transitions. Word has length 384 [2019-09-05 12:11:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:56,865 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 784 transitions. [2019-09-05 12:11:56,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 191 states. [2019-09-05 12:11:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 784 transitions. [2019-09-05 12:11:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-05 12:11:56,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:56,867 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 87, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:56,867 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:56,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1521706479, now seen corresponding path program 85 times [2019-09-05 12:11:56,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:56,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:56,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17382 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:11:59,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:59,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:59,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:59,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 192 conjunts are in the unsatisfiable core [2019-09-05 12:11:59,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17382 backedges. 0 proven. 17382 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:03,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:03,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 190] total 192 [2019-09-05 12:12:03,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-09-05 12:12:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-09-05 12:12:03,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17588, Invalid=19084, Unknown=0, NotChecked=0, Total=36672 [2019-09-05 12:12:03,655 INFO L87 Difference]: Start difference. First operand 684 states and 784 transitions. Second operand 192 states. [2019-09-05 12:12:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:17,359 INFO L93 Difference]: Finished difference Result 953 states and 1140 transitions. [2019-09-05 12:12:17,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-09-05 12:12:17,359 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 386 [2019-09-05 12:12:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:17,361 INFO L225 Difference]: With dead ends: 953 [2019-09-05 12:12:17,361 INFO L226 Difference]: Without dead ends: 947 [2019-09-05 12:12:17,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17866 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=17594, Invalid=19462, Unknown=0, NotChecked=0, Total=37056 [2019-09-05 12:12:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-09-05 12:12:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 686. [2019-09-05 12:12:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-09-05 12:12:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 786 transitions. [2019-09-05 12:12:17,368 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 786 transitions. Word has length 386 [2019-09-05 12:12:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:17,368 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 786 transitions. [2019-09-05 12:12:17,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-09-05 12:12:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 786 transitions. [2019-09-05 12:12:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-05 12:12:17,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:17,370 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 88, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:17,370 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1745915274, now seen corresponding path program 86 times [2019-09-05 12:12:17,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:17,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:12:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:12:20,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:20,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:20,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:12:20,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:12:20,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:20,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 193 conjunts are in the unsatisfiable core [2019-09-05 12:12:20,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:24,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:24,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:24,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 191] total 193 [2019-09-05 12:12:24,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 193 states [2019-09-05 12:12:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2019-09-05 12:12:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17776, Invalid=19280, Unknown=0, NotChecked=0, Total=37056 [2019-09-05 12:12:24,256 INFO L87 Difference]: Start difference. First operand 686 states and 786 transitions. Second operand 193 states. [2019-09-05 12:12:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:36,557 INFO L93 Difference]: Finished difference Result 958 states and 1146 transitions. [2019-09-05 12:12:36,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-09-05 12:12:36,557 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 388 [2019-09-05 12:12:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:36,559 INFO L225 Difference]: With dead ends: 958 [2019-09-05 12:12:36,559 INFO L226 Difference]: Without dead ends: 952 [2019-09-05 12:12:36,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18068 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=17782, Invalid=19660, Unknown=0, NotChecked=0, Total=37442 [2019-09-05 12:12:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-05 12:12:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 688. [2019-09-05 12:12:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-05 12:12:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 788 transitions. [2019-09-05 12:12:36,566 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 788 transitions. Word has length 388 [2019-09-05 12:12:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:36,566 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 788 transitions. [2019-09-05 12:12:36,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 193 states. [2019-09-05 12:12:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 788 transitions. [2019-09-05 12:12:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-05 12:12:36,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:36,568 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 89, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:36,568 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:36,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:36,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1832764827, now seen corresponding path program 87 times [2019-09-05 12:12:36,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:36,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:36,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:36,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:36,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17732 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:12:39,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:39,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:12:39,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 89 check-sat command(s) [2019-09-05 12:12:39,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:39,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 12:12:39,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:39,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 17732 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:12:40,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:40,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 95 [2019-09-05 12:12:40,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 12:12:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 12:12:40,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=4825, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:12:40,117 INFO L87 Difference]: Start difference. First operand 688 states and 788 transitions. Second operand 95 states. [2019-09-05 12:12:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:12:41,918 INFO L93 Difference]: Finished difference Result 18316 states and 18416 transitions. [2019-09-05 12:12:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 12:12:41,918 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 390 [2019-09-05 12:12:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:12:41,928 INFO L225 Difference]: With dead ends: 18316 [2019-09-05 12:12:41,928 INFO L226 Difference]: Without dead ends: 18310 [2019-09-05 12:12:41,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4111, Invalid=5009, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 12:12:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18310 states. [2019-09-05 12:12:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18310 to 685. [2019-09-05 12:12:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-09-05 12:12:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 784 transitions. [2019-09-05 12:12:41,983 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 784 transitions. Word has length 390 [2019-09-05 12:12:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:12:41,984 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 784 transitions. [2019-09-05 12:12:41,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 12:12:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 784 transitions. [2019-09-05 12:12:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-05 12:12:41,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:12:41,986 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 90, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:12:41,986 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:12:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:12:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1211608741, now seen corresponding path program 88 times [2019-09-05 12:12:41,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:12:41,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:12:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:41,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:12:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:12:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:12:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 17712 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9702 trivial. 0 not checked. [2019-09-05 12:12:44,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:12:44,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:12:45,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:12:45,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:12:45,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:12:45,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 194 conjunts are in the unsatisfiable core [2019-09-05 12:12:45,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:12:48,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:12:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17712 backedges. 0 proven. 17712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:12:48,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:12:48,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 192] total 195 [2019-09-05 12:12:48,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 195 states [2019-09-05 12:12:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2019-09-05 12:12:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18155, Invalid=19675, Unknown=0, NotChecked=0, Total=37830 [2019-09-05 12:12:48,884 INFO L87 Difference]: Start difference. First operand 685 states and 784 transitions. Second operand 195 states. [2019-09-05 12:13:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:00,464 INFO L93 Difference]: Finished difference Result 1148 states and 1339 transitions. [2019-09-05 12:13:00,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2019-09-05 12:13:00,464 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 390 [2019-09-05 12:13:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:00,466 INFO L225 Difference]: With dead ends: 1148 [2019-09-05 12:13:00,466 INFO L226 Difference]: Without dead ends: 1140 [2019-09-05 12:13:00,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18472 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=18161, Invalid=20059, Unknown=0, NotChecked=0, Total=38220 [2019-09-05 12:13:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-05 12:13:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 692. [2019-09-05 12:13:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-09-05 12:13:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 792 transitions. [2019-09-05 12:13:00,473 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 792 transitions. Word has length 390 [2019-09-05 12:13:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:00,473 INFO L475 AbstractCegarLoop]: Abstraction has 692 states and 792 transitions. [2019-09-05 12:13:00,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 195 states. [2019-09-05 12:13:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 792 transitions. [2019-09-05 12:13:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-05 12:13:00,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:00,475 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 91, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:00,475 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash -976886821, now seen corresponding path program 89 times [2019-09-05 12:13:00,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:00,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:00,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:00,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:13:03,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:03,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:03,480 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:13:03,835 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2019-09-05 12:13:03,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:03,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 196 conjunts are in the unsatisfiable core [2019-09-05 12:13:03,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:07,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:07,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 194] total 196 [2019-09-05 12:13:07,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-09-05 12:13:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-09-05 12:13:07,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18346, Invalid=19874, Unknown=0, NotChecked=0, Total=38220 [2019-09-05 12:13:07,573 INFO L87 Difference]: Start difference. First operand 692 states and 792 transitions. Second operand 196 states. [2019-09-05 12:13:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:23,856 INFO L93 Difference]: Finished difference Result 973 states and 1164 transitions. [2019-09-05 12:13:23,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2019-09-05 12:13:23,856 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 394 [2019-09-05 12:13:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:23,858 INFO L225 Difference]: With dead ends: 973 [2019-09-05 12:13:23,858 INFO L226 Difference]: Without dead ends: 967 [2019-09-05 12:13:23,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18674 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=18352, Invalid=20260, Unknown=0, NotChecked=0, Total=38612 [2019-09-05 12:13:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-05 12:13:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 694. [2019-09-05 12:13:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-05 12:13:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 794 transitions. [2019-09-05 12:13:23,864 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 794 transitions. Word has length 394 [2019-09-05 12:13:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:23,864 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 794 transitions. [2019-09-05 12:13:23,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-09-05 12:13:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 794 transitions. [2019-09-05 12:13:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-05 12:13:23,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:23,866 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 92, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:23,867 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:23,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:23,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1484472438, now seen corresponding path program 90 times [2019-09-05 12:13:23,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:23,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:23,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:23,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:23,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18272 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 9900 trivial. 0 not checked. [2019-09-05 12:13:27,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:27,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:13:27,394 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2019-09-05 12:13:27,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:27,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 197 conjunts are in the unsatisfiable core [2019-09-05 12:13:27,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:30,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:13:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18272 backedges. 0 proven. 18272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:13:31,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:31,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 195] total 197 [2019-09-05 12:13:31,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 197 states [2019-09-05 12:13:31,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2019-09-05 12:13:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18538, Invalid=20074, Unknown=0, NotChecked=0, Total=38612 [2019-09-05 12:13:31,086 INFO L87 Difference]: Start difference. First operand 694 states and 794 transitions. Second operand 197 states.