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-new/count_by_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:54:45,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:54:45,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:54:45,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:54:45,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:54:45,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:54:45,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:54:45,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:54:45,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:54:45,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:54:45,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:54:45,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:54:45,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:54:45,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:54:45,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:54:45,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:54:45,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:54:45,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:54:45,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:54:45,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:54:45,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:54:45,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:54:45,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:54:45,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:54:45,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:54:45,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:54:45,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:54:45,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:54:45,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:54:45,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:54:45,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:54:45,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:54:45,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:54:45,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:54:45,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:54:45,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:54:45,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:54:45,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:54:45,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:54:45,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:54:45,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:54:45,701 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-03 19:54:45,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:54:45,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:54:45,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:54:45,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:54:45,724 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:54:45,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:54:45,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:54:45,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:54:45,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:54:45,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:54:45,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:54:45,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:54:45,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:54:45,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:54:45,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:54:45,727 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:54:45,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:54:45,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:54:45,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:54:45,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:54:45,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:54:45,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:54:45,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:54:45,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:54:45,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:54:45,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:54:45,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:54:45,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:54:45,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:54:45,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:54:45,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:54:45,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:54:45,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:54:45,800 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:54:45,801 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_2.i [2019-09-03 19:54:45,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae3a61ce/56fa9b5932f84dbda969dd864a010ae5/FLAGf839f7859 [2019-09-03 19:54:46,299 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:54:46,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_2.i [2019-09-03 19:54:46,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae3a61ce/56fa9b5932f84dbda969dd864a010ae5/FLAGf839f7859 [2019-09-03 19:54:46,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae3a61ce/56fa9b5932f84dbda969dd864a010ae5 [2019-09-03 19:54:46,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:54:46,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:54:46,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:54:46,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:54:46,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:54:46,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:46,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35caec7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46, skipping insertion in model container [2019-09-03 19:54:46,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:46,722 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:54:46,737 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:54:46,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:54:46,901 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:54:46,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:54:46,924 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:54:46,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46 WrapperNode [2019-09-03 19:54:46,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:54:46,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:54:46,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:54:46,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:54:47,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:47,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:47,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:47,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:47,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:47,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:47,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (1/1) ... [2019-09-03 19:54:47,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:54:47,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:54:47,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:54:47,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:54:47,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (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-03 19:54:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:54:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:54:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:54:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:54:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:54:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:54:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:54:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:54:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:54:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:54:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:54:47,242 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:54:47,242 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:54:47,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:54:47 BoogieIcfgContainer [2019-09-03 19:54:47,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:54:47,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:54:47,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:54:47,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:54:47,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:54:46" (1/3) ... [2019-09-03 19:54:47,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baf5437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:54:47, skipping insertion in model container [2019-09-03 19:54:47,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:54:46" (2/3) ... [2019-09-03 19:54:47,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baf5437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:54:47, skipping insertion in model container [2019-09-03 19:54:47,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:54:47" (3/3) ... [2019-09-03 19:54:47,250 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_2.i [2019-09-03 19:54:47,259 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:54:47,265 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:54:47,283 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:54:47,311 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:54:47,312 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:54:47,312 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:54:47,312 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:54:47,313 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:54:47,313 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:54:47,313 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:54:47,313 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:54:47,313 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:54:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 19:54:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:54:47,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:47,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:47,338 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2019-09-03 19:54:47,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:47,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:47,445 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-03 19:54:47,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:54:47,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:54:47,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:54:47,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:54:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:54:47,466 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 19:54:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:47,484 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 19:54:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:54:47,485 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 19:54:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:47,494 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:54:47,494 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:54:47,498 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-03 19:54:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:54:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:54:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:54:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 19:54:47,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 19:54:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:47,538 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 19:54:47,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:54:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 19:54:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:54:47,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:47,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:47,540 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2019-09-03 19:54:47,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:47,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:47,584 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-03 19:54:47,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:54:47,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:54:47,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:54:47,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:54:47,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:54:47,588 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-03 19:54:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:47,645 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 19:54:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:54:47,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:54:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:47,648 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:54:47,648 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:54:47,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:54:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:54:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-03 19:54:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:54:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 19:54:47,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-03 19:54:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:47,656 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 19:54:47,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:54:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 19:54:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:54:47,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:47,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:47,661 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2019-09-03 19:54:47,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:47,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:47,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:47,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:54:47,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:47,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:54:47,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:47,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:47,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-03 19:54:47,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:54:47,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:54:47,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:54:47,879 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-03 19:54:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:47,922 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 19:54:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:54:47,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:54:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:47,926 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:54:47,926 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:54:47,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:54:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:54:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 19:54:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:54:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:54:47,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-03 19:54:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:47,933 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:54:47,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:54:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:54:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:54:47,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:47,934 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:47,935 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1607619511, now seen corresponding path program 2 times [2019-09-03 19:54:47,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:47,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:47,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:48,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:48,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:48,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-03 19:54:48,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:54:48,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:54:48,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:54:48,050 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-03 19:54:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:48,081 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 19:54:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:54:48,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 19:54:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:48,082 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:54:48,082 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:54:48,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:54:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:54:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 19:54:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:54:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:54:48,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-03 19:54:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:48,089 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:54:48,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:54:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:54:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:54:48,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:48,090 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:48,090 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -130515723, now seen corresponding path program 3 times [2019-09-03 19:54:48,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:48,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,149 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:48,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:54:48,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:48,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-03 19:54:48,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:54:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:54:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:54:48,203 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-03 19:54:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:48,231 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 19:54:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:54:48,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 19:54:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:48,233 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:54:48,233 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:54:48,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:54:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:54:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 19:54:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:54:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:54:48,240 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 19:54:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:48,241 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:54:48,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:54:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:54:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:54:48,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:48,242 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:48,243 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash 263802547, now seen corresponding path program 4 times [2019-09-03 19:54:48,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:48,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:48,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:48,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,345 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:48,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:48,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:48,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-03 19:54:48,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:54:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:54:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:54:48,407 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-03 19:54:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:48,450 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 19:54:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:54:48,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-03 19:54:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:48,453 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:54:48,453 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:54:48,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:54:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:54:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 19:54:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:54:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:54:48,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-03 19:54:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:48,459 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:54:48,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:54:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:54:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:54:48,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:48,461 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:48,461 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1246537969, now seen corresponding path program 5 times [2019-09-03 19:54:48,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:48,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,558 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:48,571 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:54:48,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:48,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-03 19:54:48,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:54:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:54:48,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:54:48,588 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-03 19:54:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:48,642 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 19:54:48,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:54:48,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 19:54:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:48,644 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:54:48,644 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:54:48,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:54:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:54:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 19:54:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:54:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:54:48,649 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-03 19:54:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:48,650 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:54:48,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:54:48,650 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:54:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:54:48,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:48,651 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:48,651 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:48,652 INFO L82 PathProgramCache]: Analyzing trace with hash 762473391, now seen corresponding path program 6 times [2019-09-03 19:54:48,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:48,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:48,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:48,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,731 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-03 19:54:48,746 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,763 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:54:48,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:48,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-03 19:54:48,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:54:48,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:54:48,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:54:48,780 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-03 19:54:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:48,822 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 19:54:48,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:54:48,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 19:54:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:48,823 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:54:48,824 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:54:48,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:54:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:54:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 19:54:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:54:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:54:48,829 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-03 19:54:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:48,829 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:54:48,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:54:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:54:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:54:48,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:48,830 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:48,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash -567118099, now seen corresponding path program 7 times [2019-09-03 19:54:48,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:48,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:48,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,933 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-03 19:54:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:48,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-03 19:54:48,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:54:48,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:54:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:54:48,994 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-03 19:54:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:49,034 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 19:54:49,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:54:49,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-03 19:54:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:49,038 INFO L225 Difference]: With dead ends: 33 [2019-09-03 19:54:49,038 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:54:49,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:54:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:54:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 19:54:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:54:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:54:49,049 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-03 19:54:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:49,049 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:54:49,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:54:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:54:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:54:49,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:49,052 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:49,053 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1595714219, now seen corresponding path program 8 times [2019-09-03 19:54:49,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:49,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:49,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:49,164 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) [2019-09-03 19:54:49,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:49,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:49,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:49,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:54:49,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:49,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:49,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-03 19:54:49,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:54:49,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:54:49,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:54:49,217 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-03 19:54:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:49,268 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 19:54:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:54:49,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-03 19:54:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:49,270 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:54:49,270 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:54:49,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:54:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:54:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 19:54:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:54:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:54:49,275 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-03 19:54:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:49,275 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:54:49,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:54:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:54:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:54:49,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:49,277 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:49,277 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400553, now seen corresponding path program 9 times [2019-09-03 19:54:49,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:49,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:49,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:49,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:49,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:54:49,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:49,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:54:49,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:49,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:54:49,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:49,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:49,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-03 19:54:49,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:54:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:54:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:54:49,656 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-03 19:54:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:49,698 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 19:54:49,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:54:49,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-03 19:54:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:49,699 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:54:49,699 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:54:49,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:54:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:54:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 19:54:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:54:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:54:49,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-03 19:54:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:49,705 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:54:49,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:54:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:54:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:54:49,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:49,706 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:49,706 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash 592907175, now seen corresponding path program 10 times [2019-09-03 19:54:49,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:49,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:49,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:49,850 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-03 19:54:49,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:49,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:49,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:49,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:54:49,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:49,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:49,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-03 19:54:49,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:54:49,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:54:49,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:54:49,901 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-09-03 19:54:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:49,965 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 19:54:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:54:49,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-03 19:54:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:49,966 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:54:49,966 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:54:49,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:54:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:54:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 19:54:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:54:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:54:49,972 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-03 19:54:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:49,972 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:54:49,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:54:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:54:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:54:49,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:49,973 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:49,973 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash -311494427, now seen corresponding path program 11 times [2019-09-03 19:54:49,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:49,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:49,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:50,125 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-03 19:54:50,143 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:50,156 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:54:50,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:50,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:54:50,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:50,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-03 19:54:50,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:54:50,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:54:50,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:54:50,173 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-09-03 19:54:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:50,212 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 19:54:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:54:50,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-09-03 19:54:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:50,215 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:54:50,215 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:54:50,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:54:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:54:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 19:54:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:54:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:54:50,220 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-03 19:54:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:50,221 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:54:50,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:54:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:54:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:54:50,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:50,221 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:50,222 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1858040157, now seen corresponding path program 12 times [2019-09-03 19:54:50,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:50,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:50,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:50,364 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-03 19:54:50,384 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:50,409 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:54:50,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:50,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:54:50,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:50,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-03 19:54:50,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:54:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:54:50,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:54:50,440 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-09-03 19:54:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:50,490 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 19:54:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:54:50,491 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-03 19:54:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:50,492 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:54:50,492 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:54:50,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:54:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:54:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 19:54:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:54:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:54:50,501 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-03 19:54:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:50,501 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:54:50,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:54:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:54:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:54:50,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:50,502 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:50,502 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2029802271, now seen corresponding path program 13 times [2019-09-03 19:54:50,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:50,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:50,663 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-03 19:54:50,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:50,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:54:50,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:50,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-03 19:54:50,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:54:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:54:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:54:50,706 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-09-03 19:54:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:50,758 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 19:54:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:54:50,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-09-03 19:54:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:50,759 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:54:50,759 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:54:50,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:54:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:54:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 19:54:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:54:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:54:50,764 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-03 19:54:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:50,765 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:54:50,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:54:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:54:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:54:50,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:50,766 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:50,766 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:50,766 INFO L82 PathProgramCache]: Analyzing trace with hash 410530719, now seen corresponding path program 14 times [2019-09-03 19:54:50,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:50,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:50,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:50,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 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-03 19:54:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:50,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:50,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:50,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:54:50,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:50,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:50,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-03 19:54:50,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:54:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:54:50,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:54:50,980 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-09-03 19:54:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:51,022 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 19:54:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:54:51,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-09-03 19:54:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:51,023 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:54:51,023 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:54:51,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:54:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:54:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 19:54:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:54:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:54:51,029 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-03 19:54:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:51,030 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:54:51,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:54:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:54:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:54:51,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:51,031 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:51,031 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:51,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:51,031 INFO L82 PathProgramCache]: Analyzing trace with hash 518390493, now seen corresponding path program 15 times [2019-09-03 19:54:51,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:51,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:51,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:51,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:51,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:51,190 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) [2019-09-03 19:54:51,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:51,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:54:51,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:51,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:54:51,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:51,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-03 19:54:51,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:54:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:54:51,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:54:51,254 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-09-03 19:54:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:51,318 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 19:54:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:54:51,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-03 19:54:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:51,319 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:54:51,320 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:54:51,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:54:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:54:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 19:54:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:54:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:54:51,325 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-03 19:54:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:51,325 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:54:51,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:54:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:54:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:54:51,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:51,326 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:51,326 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1092418203, now seen corresponding path program 16 times [2019-09-03 19:54:51,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:51,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:51,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:51,504 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-03 19:54:51,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:51,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:51,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:51,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:54:51,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:51,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:51,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-03 19:54:51,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:54:51,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:54:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:54:51,556 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-09-03 19:54:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:51,596 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-03 19:54:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:54:51,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-09-03 19:54:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:51,597 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:54:51,597 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:54:51,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:54:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:54:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 19:54:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:54:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:54:51,603 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-03 19:54:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:51,604 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:54:51,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:54:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:54:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:54:51,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:51,605 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:51,605 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:51,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1317733671, now seen corresponding path program 17 times [2019-09-03 19:54:51,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:51,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:51,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:51,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:54:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:51,851 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:54:51,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:51,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:54:51,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:51,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:51,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-03 19:54:51,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:54:51,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:54:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:54:51,872 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-09-03 19:54:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:51,921 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-03 19:54:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:54:51,922 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-09-03 19:54:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:51,923 INFO L225 Difference]: With dead ends: 53 [2019-09-03 19:54:51,923 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:54:51,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:54:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:54:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 19:54:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:54:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 19:54:51,928 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-03 19:54:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:51,928 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 19:54:51,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:54:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 19:54:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:54:51,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:51,929 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:51,929 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1808655255, now seen corresponding path program 18 times [2019-09-03 19:54:51,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:51,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:51,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:51,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:52,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:52,108 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-03 19:54:52,124 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:52,142 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:54:52,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:52,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:54:52,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:52,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:52,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-03 19:54:52,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:54:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:54:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:54:52,170 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-09-03 19:54:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:52,243 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-03 19:54:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:54:52,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-09-03 19:54:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:52,244 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:54:52,244 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:54:52,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:54:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:54:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 19:54:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:54:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 19:54:52,253 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-03 19:54:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:52,254 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 19:54:52,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:54:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 19:54:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:54:52,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:52,255 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:52,256 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:52,256 INFO L82 PathProgramCache]: Analyzing trace with hash -208694059, now seen corresponding path program 19 times [2019-09-03 19:54:52,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:52,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:52,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:52,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:52,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:52,475 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-03 19:54:52,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:52,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:54:52,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:52,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:52,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-03 19:54:52,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:54:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:54:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:54:52,518 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-09-03 19:54:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:52,591 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-03 19:54:52,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:54:52,593 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-03 19:54:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:52,594 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:54:52,594 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:54:52,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:54:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:54:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 19:54:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:54:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 19:54:52,599 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-03 19:54:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:52,600 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 19:54:52,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:54:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 19:54:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:54:52,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:52,601 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:52,601 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1851134317, now seen corresponding path program 20 times [2019-09-03 19:54:52,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:52,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:52,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:52,866 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-03 19:54:52,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:52,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:52,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:52,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:54:52,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:52,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:52,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-03 19:54:52,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:54:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:54:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:54:52,917 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-09-03 19:54:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:52,982 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-03 19:54:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:54:52,983 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-03 19:54:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:52,984 INFO L225 Difference]: With dead ends: 59 [2019-09-03 19:54:52,984 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:54:52,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:54:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:54:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 19:54:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:54:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 19:54:52,988 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-03 19:54:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:52,989 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 19:54:52,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:54:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 19:54:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:54:52,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:52,990 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:52,990 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 311742673, now seen corresponding path program 21 times [2019-09-03 19:54:52,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:52,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:53,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:53,238 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-03 19:54:53,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:53,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 19:54:53,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:53,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:54:53,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:53,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:53,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-03 19:54:53,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:54:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:54:53,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:54:53,296 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-09-03 19:54:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:53,358 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-03 19:54:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:54:53,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-09-03 19:54:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:53,359 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:54:53,359 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:54:53,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:54:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:54:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 19:54:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:54:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 19:54:53,362 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-03 19:54:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:53,362 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 19:54:53,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:54:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 19:54:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:54:53,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:53,363 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:53,363 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 72358799, now seen corresponding path program 22 times [2019-09-03 19:54:53,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:53,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:53,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:53,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:53,624 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-03 19:54:53,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:53,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:53,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:53,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:54:53,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:53,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:53,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-03 19:54:53,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:54:53,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:54:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:54:53,668 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-03 19:54:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:53,723 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-03 19:54:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:54:53,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-09-03 19:54:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:53,724 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:54:53,724 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:54:53,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:54:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:54:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 19:54:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:54:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 19:54:53,737 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-03 19:54:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:53,738 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 19:54:53,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:54:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 19:54:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:54:53,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:53,739 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:53,739 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1952689869, now seen corresponding path program 23 times [2019-09-03 19:54:53,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:53,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:53,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:53,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:53,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:54,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:54,047 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-03 19:54:54,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:54,088 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:54:54,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:54,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:54:54,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:54,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-03 19:54:54,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:54:54,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:54:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:54:54,121 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-09-03 19:54:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:54,195 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-03 19:54:54,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:54:54,195 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-03 19:54:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:54,196 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:54:54,196 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:54:54,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:54:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:54:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-03 19:54:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:54:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-03 19:54:54,202 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-03 19:54:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:54,202 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-03 19:54:54,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:54:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-03 19:54:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:54:54,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:54,203 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:54,203 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash 769616523, now seen corresponding path program 24 times [2019-09-03 19:54:54,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:54,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:54,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:54,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:54,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:54:54,777 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:54,804 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:54:54,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:54,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:54:54,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:54,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:54,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-03 19:54:54,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:54:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:54:54,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:54:54,825 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-09-03 19:54:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:54,894 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-03 19:54:54,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:54:54,894 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-03 19:54:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:54,895 INFO L225 Difference]: With dead ends: 67 [2019-09-03 19:54:54,895 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 19:54:54,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:54:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 19:54:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 19:54:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:54:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-03 19:54:54,899 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-03 19:54:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:54,900 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-03 19:54:54,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:54:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-03 19:54:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:54:54,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:54,901 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:54,901 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:54,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:54,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2002464457, now seen corresponding path program 25 times [2019-09-03 19:54:54,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:54,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:55,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:55,263 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) [2019-09-03 19:54:55,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:55,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:54:55,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:55,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:55,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-03 19:54:55,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:54:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:54:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:54:55,319 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-09-03 19:54:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:55,410 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-03 19:54:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:54:55,410 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-09-03 19:54:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:55,411 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:54:55,411 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:54:55,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:54:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:54:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 19:54:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:54:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-03 19:54:55,415 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-03 19:54:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:55,415 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-03 19:54:55,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:54:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-03 19:54:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:54:55,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:55,416 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:55,416 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:55,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1358355335, now seen corresponding path program 26 times [2019-09-03 19:54:55,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:55,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:55,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:55,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:55,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:55,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:54:55,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:55,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:55,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:55,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:54:55,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:55,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-03 19:54:55,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:54:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:54:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:54:55,857 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-09-03 19:54:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:55,946 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-03 19:54:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:54:55,947 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-09-03 19:54:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:55,948 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:54:55,948 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:54:55,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:54:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:54:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-03 19:54:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 19:54:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-03 19:54:55,953 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-03 19:54:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:55,954 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-03 19:54:55,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:54:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-03 19:54:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:54:55,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:55,955 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:55,956 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash 844779717, now seen corresponding path program 27 times [2019-09-03 19:54:55,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:55,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:56,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:56,388 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-03 19:54:56,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:56,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 19:54:56,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:56,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:54:56,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:56,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:56,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-03 19:54:56,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:54:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:54:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:54:56,449 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-09-03 19:54:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:56,541 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-03 19:54:56,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:54:56,542 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-03 19:54:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:56,543 INFO L225 Difference]: With dead ends: 73 [2019-09-03 19:54:56,543 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 19:54:56,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:54:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 19:54:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 19:54:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:54:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-03 19:54:56,548 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-03 19:54:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:56,548 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-03 19:54:56,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:54:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-03 19:54:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 19:54:56,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:56,549 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:56,549 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:56,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:56,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1219849859, now seen corresponding path program 28 times [2019-09-03 19:54:56,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:56,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:56,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:56,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:56,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:56,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:56,917 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-03 19:54:56,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:56,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:56,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:56,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:54:56,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:56,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:56,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-03 19:54:56,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:54:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:54:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:54:56,970 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-09-03 19:54:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:57,059 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-03 19:54:57,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:54:57,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-09-03 19:54:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:57,061 INFO L225 Difference]: With dead ends: 75 [2019-09-03 19:54:57,061 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:54:57,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:54:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:54:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-03 19:54:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:54:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-03 19:54:57,066 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-03 19:54:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:57,066 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-03 19:54:57,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:54:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-03 19:54:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:54:57,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:57,068 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:57,068 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash 885003457, now seen corresponding path program 29 times [2019-09-03 19:54:57,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:57,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:57,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:57,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:57,524 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-03 19:54:57,534 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:57,569 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-03 19:54:57,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:57,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:54:57,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:57,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:57,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-03 19:54:57,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:54:57,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:54:57,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:54:57,588 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-09-03 19:54:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:57,653 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-03 19:54:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:54:57,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-09-03 19:54:57,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:57,654 INFO L225 Difference]: With dead ends: 77 [2019-09-03 19:54:57,654 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:54:57,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:54:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:54:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 19:54:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:54:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-03 19:54:57,659 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-03 19:54:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:57,659 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-03 19:54:57,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:54:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-03 19:54:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:54:57,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:57,660 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:57,662 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1220158335, now seen corresponding path program 30 times [2019-09-03 19:54:57,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:57,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:57,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:57,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:58,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:58,056 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-03 19:54:58,066 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:58,100 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:54:58,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:58,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:58,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:58,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:58,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-03 19:54:58,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:54:58,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:54:58,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:54:58,120 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-09-03 19:54:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:58,188 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-03 19:54:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:54:58,189 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-09-03 19:54:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:58,189 INFO L225 Difference]: With dead ends: 79 [2019-09-03 19:54:58,190 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 19:54:58,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:54:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 19:54:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 19:54:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:54:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-03 19:54:58,194 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-03 19:54:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:58,194 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-03 19:54:58,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:54:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-03 19:54:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:54:58,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:58,195 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:58,195 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1181448893, now seen corresponding path program 31 times [2019-09-03 19:54:58,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:58,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:58,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:54:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:58,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:54:58,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:58,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:58,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-03 19:54:58,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:54:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:54:58,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:54:58,846 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-09-03 19:54:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:58,948 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-03 19:54:58,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:54:58,949 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-03 19:54:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:58,950 INFO L225 Difference]: With dead ends: 81 [2019-09-03 19:54:58,950 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 19:54:58,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:54:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 19:54:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-03 19:54:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 19:54:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-03 19:54:58,954 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-03 19:54:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:58,954 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-03 19:54:58,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:54:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-03 19:54:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 19:54:58,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:58,955 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:58,955 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1658586501, now seen corresponding path program 32 times [2019-09-03 19:54:58,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:58,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:59,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:59,421 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-03 19:54:59,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:59,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:59,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:59,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:54:59,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:59,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:59,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-03 19:54:59,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:54:59,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:54:59,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:54:59,468 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-09-03 19:54:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:59,537 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-03 19:54:59,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:54:59,537 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-09-03 19:54:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:59,538 INFO L225 Difference]: With dead ends: 83 [2019-09-03 19:54:59,538 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 19:54:59,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:54:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 19:54:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 19:54:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 19:54:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-03 19:54:59,544 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-03 19:54:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:59,544 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-03 19:54:59,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:54:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-03 19:54:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:54:59,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:59,546 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:59,547 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:59,547 INFO L82 PathProgramCache]: Analyzing trace with hash 666600121, now seen corresponding path program 33 times [2019-09-03 19:54:59,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:59,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:59,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:59,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:59,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:00,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:00,082 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-03 19:55:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:00,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 19:55:00,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:00,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:55:00,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:00,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-03 19:55:00,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:55:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:55:00,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:55:00,158 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-09-03 19:55:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:00,256 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-03 19:55:00,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:55:00,257 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-03 19:55:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:00,257 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:55:00,257 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:55:00,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:55:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:55:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 19:55:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:55:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-03 19:55:00,261 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-03 19:55:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:00,261 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-03 19:55:00,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:55:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-03 19:55:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:55:00,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:00,263 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:00,263 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1787949943, now seen corresponding path program 34 times [2019-09-03 19:55:00,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:00,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:00,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:00,742 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-03 19:55:00,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:00,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:00,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:00,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:55:00,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:00,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:00,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-03 19:55:00,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:55:00,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:55:00,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:55:00,789 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-09-03 19:55:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:00,877 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-03 19:55:00,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:55:00,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-03 19:55:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:00,878 INFO L225 Difference]: With dead ends: 87 [2019-09-03 19:55:00,878 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 19:55:00,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:55:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 19:55:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-03 19:55:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 19:55:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-03 19:55:00,882 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-03 19:55:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:00,883 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-03 19:55:00,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:55:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-03 19:55:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:55:00,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:00,884 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:00,884 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1368337589, now seen corresponding path program 35 times [2019-09-03 19:55:00,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:00,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:00,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:00,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:01,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:01,421 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-03 19:55:01,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:01,464 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-03 19:55:01,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:01,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:55:01,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:01,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:01,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-03 19:55:01,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:55:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:55:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:55:01,487 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-09-03 19:55:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:01,582 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-09-03 19:55:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:55:01,584 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-03 19:55:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:01,585 INFO L225 Difference]: With dead ends: 89 [2019-09-03 19:55:01,585 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 19:55:01,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:55:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 19:55:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-03 19:55:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 19:55:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-03 19:55:01,589 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-03 19:55:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:01,590 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-03 19:55:01,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:55:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-03 19:55:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:55:01,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:01,592 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:01,592 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1847791219, now seen corresponding path program 36 times [2019-09-03 19:55:01,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:01,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:01,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:02,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:02,166 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-03 19:55:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:02,220 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:55:02,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:02,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:55:02,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:02,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:02,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-03 19:55:02,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:55:02,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:55:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:55:02,245 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-09-03 19:55:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:02,352 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-09-03 19:55:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:55:02,352 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-09-03 19:55:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:02,353 INFO L225 Difference]: With dead ends: 91 [2019-09-03 19:55:02,353 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 19:55:02,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:55:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 19:55:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-03 19:55:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 19:55:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-03 19:55:02,357 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-03 19:55:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:02,358 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-03 19:55:02,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:55:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-03 19:55:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:55:02,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:02,372 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:02,373 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1253738319, now seen corresponding path program 37 times [2019-09-03 19:55:02,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:02,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:02,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:02,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:02,953 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-03 19:55:02,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:02,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:55:02,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:02,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:02,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-03 19:55:03,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:55:03,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:55:03,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:55:03,001 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-09-03 19:55:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:03,117 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-09-03 19:55:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:55:03,117 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-09-03 19:55:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:03,118 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:55:03,118 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 19:55:03,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:55:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 19:55:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 19:55:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 19:55:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-03 19:55:03,122 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-03 19:55:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:03,123 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-03 19:55:03,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:55:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-03 19:55:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:55:03,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:03,124 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:03,124 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1116320913, now seen corresponding path program 38 times [2019-09-03 19:55:03,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:03,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:03,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:03,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:55:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:03,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:03,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:03,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:55:03,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:03,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:03,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-03 19:55:03,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:55:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:55:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:55:03,813 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-09-03 19:55:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:03,941 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-09-03 19:55:03,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:55:03,942 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-09-03 19:55:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:03,943 INFO L225 Difference]: With dead ends: 95 [2019-09-03 19:55:03,943 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:55:03,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:55:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:55:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-03 19:55:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:55:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-03 19:55:03,951 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-03 19:55:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:03,952 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-03 19:55:03,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:55:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-03 19:55:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:55:03,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:03,953 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:03,953 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2092787373, now seen corresponding path program 39 times [2019-09-03 19:55:03,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:03,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:04,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:04,569 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-03 19:55:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:04,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 19:55:04,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:04,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:55:04,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:04,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:04,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-03 19:55:04,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:55:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:55:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:55:04,649 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-09-03 19:55:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:04,802 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-09-03 19:55:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:55:04,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-03 19:55:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:04,808 INFO L225 Difference]: With dead ends: 97 [2019-09-03 19:55:04,808 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 19:55:04,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:55:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 19:55:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-03 19:55:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 19:55:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-03 19:55:04,813 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-03 19:55:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:04,813 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-03 19:55:04,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:55:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-03 19:55:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 19:55:04,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:04,814 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:04,814 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2035635605, now seen corresponding path program 40 times [2019-09-03 19:55:04,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:04,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:04,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:04,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:04,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:05,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:05,716 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-03 19:55:05,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:05,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:05,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:05,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:55:05,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:05,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-03 19:55:05,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:55:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:55:05,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:55:05,771 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-09-03 19:55:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:05,895 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-09-03 19:55:05,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:55:05,895 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-09-03 19:55:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:05,896 INFO L225 Difference]: With dead ends: 99 [2019-09-03 19:55:05,896 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:55:05,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:55:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:55:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 19:55:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:55:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-03 19:55:05,902 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-03 19:55:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:05,902 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-03 19:55:05,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:55:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-03 19:55:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:55:05,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:05,904 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:05,904 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:05,904 INFO L82 PathProgramCache]: Analyzing trace with hash -900335959, now seen corresponding path program 41 times [2019-09-03 19:55:05,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:05,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:05,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:06,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:06,614 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-03 19:55:06,625 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:06,678 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-03 19:55:06,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:06,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:55:06,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:06,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:06,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-03 19:55:06,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:55:06,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:55:06,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:55:06,697 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-09-03 19:55:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:06,817 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-09-03 19:55:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:55:06,818 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-09-03 19:55:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:06,819 INFO L225 Difference]: With dead ends: 101 [2019-09-03 19:55:06,819 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 19:55:06,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:55:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 19:55:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-03 19:55:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:55:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-03 19:55:06,824 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-03 19:55:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:06,825 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-03 19:55:06,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:55:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-03 19:55:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:55:06,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:06,826 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:06,827 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:06,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash -799069337, now seen corresponding path program 42 times [2019-09-03 19:55:06,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:06,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:06,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:07,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:07,583 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-03 19:55:07,593 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:07,640 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 19:55:07,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:07,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:55:07,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:07,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:07,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-03 19:55:07,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:55:07,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:55:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:55:07,663 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-09-03 19:55:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:07,814 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-09-03 19:55:07,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:55:07,814 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-09-03 19:55:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:07,815 INFO L225 Difference]: With dead ends: 103 [2019-09-03 19:55:07,815 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 19:55:07,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:55:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 19:55:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-03 19:55:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 19:55:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-03 19:55:07,819 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-03 19:55:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:07,820 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-03 19:55:07,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:55:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-03 19:55:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:55:07,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:07,821 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:07,821 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2028873893, now seen corresponding path program 43 times [2019-09-03 19:55:07,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:07,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:08,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:08,571 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-03 19:55:08,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:08,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:55:08,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:08,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:08,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-03 19:55:08,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:55:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:55:08,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:55:08,630 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-09-03 19:55:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:08,796 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-09-03 19:55:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:55:08,796 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-03 19:55:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:08,798 INFO L225 Difference]: With dead ends: 105 [2019-09-03 19:55:08,798 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 19:55:08,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:55:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 19:55:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-03 19:55:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 19:55:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-03 19:55:08,803 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-03 19:55:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:08,803 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-03 19:55:08,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:55:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-03 19:55:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 19:55:08,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:08,805 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:08,805 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 968019555, now seen corresponding path program 44 times [2019-09-03 19:55:08,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:08,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:09,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:09,568 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-03 19:55:09,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:09,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:09,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:09,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:55:09,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:09,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:09,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-03 19:55:09,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:55:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:55:09,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:55:09,625 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-09-03 19:55:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:09,752 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-09-03 19:55:09,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:55:09,752 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-09-03 19:55:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:09,753 INFO L225 Difference]: With dead ends: 107 [2019-09-03 19:55:09,753 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 19:55:09,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:55:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 19:55:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-03 19:55:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 19:55:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-03 19:55:09,758 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-03 19:55:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:09,759 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-03 19:55:09,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:55:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-03 19:55:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 19:55:09,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:09,760 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:09,760 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:09,760 INFO L82 PathProgramCache]: Analyzing trace with hash -605750111, now seen corresponding path program 45 times [2019-09-03 19:55:09,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:09,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:09,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:09,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:09,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:10,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:10,601 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-03 19:55:10,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:10,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-03 19:55:10,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:10,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:55:10,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:10,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:10,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-03 19:55:10,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:55:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:55:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:55:10,696 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-09-03 19:55:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:10,873 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-09-03 19:55:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:55:10,873 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-09-03 19:55:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:10,874 INFO L225 Difference]: With dead ends: 109 [2019-09-03 19:55:10,874 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:55:10,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:55:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:55:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 19:55:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:55:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-03 19:55:10,878 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-03 19:55:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:10,879 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-03 19:55:10,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:55:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-03 19:55:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:55:10,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:10,880 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:10,880 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1169910945, now seen corresponding path program 46 times [2019-09-03 19:55:10,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:10,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:10,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:12,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:12,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:55:12,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:12,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:12,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:12,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:55:12,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:12,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:12,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-03 19:55:12,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:55:12,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:55:12,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:55:12,258 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-09-03 19:55:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:12,391 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-09-03 19:55:12,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:55:12,391 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-09-03 19:55:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:12,392 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:55:12,392 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:55:12,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:55:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:55:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-03 19:55:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 19:55:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-03 19:55:12,400 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-03 19:55:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:12,401 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-03 19:55:12,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:55:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-03 19:55:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:55:12,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:12,402 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:12,402 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:12,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2132374173, now seen corresponding path program 47 times [2019-09-03 19:55:12,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:12,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:12,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:13,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:13,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 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-03 19:55:13,388 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:13,441 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-03 19:55:13,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:13,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:55:13,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:13,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:13,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-03 19:55:13,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:55:13,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:55:13,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:55:13,467 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-09-03 19:55:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:13,635 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-09-03 19:55:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:55:13,636 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-03 19:55:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:13,637 INFO L225 Difference]: With dead ends: 113 [2019-09-03 19:55:13,637 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 19:55:13,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:55:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 19:55:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 19:55:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 19:55:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-03 19:55:13,642 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-03 19:55:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:13,643 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-03 19:55:13,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:55:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-03 19:55:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 19:55:13,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:13,644 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:13,644 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1647540827, now seen corresponding path program 48 times [2019-09-03 19:55:13,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:13,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:13,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:13,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:13,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:14,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:14,662 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) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:14,673 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:14,731 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 19:55:14,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:14,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:55:14,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:14,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:14,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-03 19:55:14,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:55:14,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:55:14,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:55:14,796 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-09-03 19:55:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:15,043 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-09-03 19:55:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:55:15,043 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-03 19:55:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:15,044 INFO L225 Difference]: With dead ends: 115 [2019-09-03 19:55:15,044 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:55:15,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:55:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:55:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-03 19:55:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 19:55:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-03 19:55:15,050 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-03 19:55:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:15,051 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-03 19:55:15,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:55:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-03 19:55:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 19:55:15,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:15,052 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:15,053 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:15,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash -420836711, now seen corresponding path program 49 times [2019-09-03 19:55:15,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:15,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:15,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:15,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:15,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:16,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:16,024 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-03 19:55:16,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:16,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:55:16,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:16,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-03 19:55:16,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:55:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:55:16,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:55:16,084 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-09-03 19:55:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:16,228 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-09-03 19:55:16,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:55:16,229 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-09-03 19:55:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:16,230 INFO L225 Difference]: With dead ends: 117 [2019-09-03 19:55:16,230 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:55:16,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:55:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:55:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-03 19:55:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:55:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-03 19:55:16,235 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-03 19:55:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:16,235 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-03 19:55:16,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:55:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-03 19:55:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:55:16,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:16,237 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:16,237 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash 438207319, now seen corresponding path program 50 times [2019-09-03 19:55:16,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:16,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:16,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:17,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:17,196 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-03 19:55:17,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:17,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:17,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:17,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:55:17,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:17,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:17,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-03 19:55:17,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:55:17,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:55:17,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:55:17,261 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-09-03 19:55:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:17,407 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-09-03 19:55:17,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:55:17,412 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-09-03 19:55:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:17,413 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:55:17,413 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:55:17,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:55:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:55:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-03 19:55:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:55:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-03 19:55:17,417 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-03 19:55:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:17,417 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-03 19:55:17,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:55:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-03 19:55:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:55:17,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:17,418 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:17,419 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1345799317, now seen corresponding path program 51 times [2019-09-03 19:55:17,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:17,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:17,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:17,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:17,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:18,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:18,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 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-03 19:55:18,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:18,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-03 19:55:18,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:18,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:55:18,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:18,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:18,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-03 19:55:18,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:55:18,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:55:18,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:55:18,840 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-09-03 19:55:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:19,011 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-09-03 19:55:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:55:19,012 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-03 19:55:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:19,013 INFO L225 Difference]: With dead ends: 121 [2019-09-03 19:55:19,013 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:55:19,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:55:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:55:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 19:55:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 19:55:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-03 19:55:19,018 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-03 19:55:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:19,018 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-03 19:55:19,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:55:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-03 19:55:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:55:19,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:19,019 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:19,019 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1663348307, now seen corresponding path program 52 times [2019-09-03 19:55:19,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:19,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:19,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:19,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:19,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:20,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:20,072 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) [2019-09-03 19:55:20,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:20,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:20,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:20,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:55:20,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:20,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:20,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-03 19:55:20,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:55:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:55:20,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:55:20,143 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-09-03 19:55:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:20,310 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-09-03 19:55:20,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:55:20,310 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-03 19:55:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:20,311 INFO L225 Difference]: With dead ends: 123 [2019-09-03 19:55:20,312 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:55:20,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:55:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:55:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-03 19:55:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 19:55:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-03 19:55:20,318 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-03 19:55:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:20,318 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-03 19:55:20,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:55:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-03 19:55:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 19:55:20,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:20,319 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:20,319 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1885249681, now seen corresponding path program 53 times [2019-09-03 19:55:20,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:20,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:20,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:21,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:21,388 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-03 19:55:21,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:21,467 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-03 19:55:21,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:21,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:55:21,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:21,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:21,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-03 19:55:21,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:55:21,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:55:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:55:21,500 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-09-03 19:55:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:21,696 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-09-03 19:55:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:55:21,697 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-03 19:55:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:21,697 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:55:21,697 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 19:55:21,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:55:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 19:55:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 19:55:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 19:55:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-03 19:55:21,701 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-03 19:55:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:21,701 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-03 19:55:21,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:55:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-03 19:55:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 19:55:21,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:21,702 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:21,702 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash 384105295, now seen corresponding path program 54 times [2019-09-03 19:55:21,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:21,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:21,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:22,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:22,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:55:22,826 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:22,890 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-03 19:55:22,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:22,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:55:22,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:22,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:22,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-03 19:55:22,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:55:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:55:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:55:22,924 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-09-03 19:55:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:23,124 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-09-03 19:55:23,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:55:23,124 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-03 19:55:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:23,125 INFO L225 Difference]: With dead ends: 127 [2019-09-03 19:55:23,125 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 19:55:23,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:55:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 19:55:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-03 19:55:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 19:55:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-03 19:55:23,129 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-03 19:55:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:23,130 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-03 19:55:23,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:55:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-03 19:55:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:55:23,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:23,131 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:23,131 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 893361805, now seen corresponding path program 55 times [2019-09-03 19:55:23,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:23,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:23,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:23,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:24,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:24,350 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) [2019-09-03 19:55:24,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:24,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:55:24,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:24,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:24,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-03 19:55:24,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:55:24,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:55:24,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:55:24,427 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2019-09-03 19:55:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:24,577 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-09-03 19:55:24,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:55:24,577 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-03 19:55:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:24,579 INFO L225 Difference]: With dead ends: 129 [2019-09-03 19:55:24,579 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 19:55:24,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:55:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 19:55:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-03 19:55:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 19:55:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-03 19:55:24,584 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-03 19:55:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:24,584 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-03 19:55:24,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:55:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-03 19:55:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 19:55:24,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:24,585 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:24,585 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 662596171, now seen corresponding path program 56 times [2019-09-03 19:55:24,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:24,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:25,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:25,791 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-03 19:55:25,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:25,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:25,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:25,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:55:25,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (57)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:25,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:25,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-03 19:55:25,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:55:25,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:55:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:55:25,860 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2019-09-03 19:55:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:26,017 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-09-03 19:55:26,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:55:26,018 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2019-09-03 19:55:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:26,019 INFO L225 Difference]: With dead ends: 131 [2019-09-03 19:55:26,019 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 19:55:26,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:55:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 19:55:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-03 19:55:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-03 19:55:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-03 19:55:26,023 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-03 19:55:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:26,023 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-03 19:55:26,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:55:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-03 19:55:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 19:55:26,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:26,024 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:26,025 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2059846007, now seen corresponding path program 57 times [2019-09-03 19:55:26,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:26,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:26,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:26,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:27,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:27,312 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-03 19:55:27,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:27,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-03 19:55:27,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:27,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:55:27,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:27,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:27,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-03 19:55:27,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:55:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:55:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:55:27,431 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2019-09-03 19:55:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:27,647 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-09-03 19:55:27,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 19:55:27,648 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2019-09-03 19:55:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:27,649 INFO L225 Difference]: With dead ends: 133 [2019-09-03 19:55:27,649 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:55:27,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:55:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:55:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 19:55:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 19:55:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-03 19:55:27,653 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-03 19:55:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:27,654 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-03 19:55:27,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:55:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-03 19:55:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 19:55:27,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:27,655 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:27,655 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1603271495, now seen corresponding path program 58 times [2019-09-03 19:55:27,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:27,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:27,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:28,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:28,983 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-03 19:55:28,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:29,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:29,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:29,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:55:29,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:29,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:29,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-03 19:55:29,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:55:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:55:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:55:29,041 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2019-09-03 19:55:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:29,239 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-09-03 19:55:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:55:29,240 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2019-09-03 19:55:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:29,241 INFO L225 Difference]: With dead ends: 135 [2019-09-03 19:55:29,241 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 19:55:29,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:55:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 19:55:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-03 19:55:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 19:55:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-03 19:55:29,245 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-03 19:55:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:29,245 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-03 19:55:29,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:55:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-03 19:55:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:29,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:29,246 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:29,247 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash -13991803, now seen corresponding path program 59 times [2019-09-03 19:55:29,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:29,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:29,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:29,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:29,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:30,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:30,738 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-03 19:55:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:30,815 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-03 19:55:30,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:30,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:55:30,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:30,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:30,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-03 19:55:30,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:55:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:55:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:55:30,847 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2019-09-03 19:55:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:31,066 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-09-03 19:55:31,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:55:31,066 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-03 19:55:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:31,068 INFO L225 Difference]: With dead ends: 137 [2019-09-03 19:55:31,068 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 19:55:31,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:55:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 19:55:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-03 19:55:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 19:55:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-03 19:55:31,071 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-03 19:55:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:31,071 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-03 19:55:31,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:55:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-03 19:55:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 19:55:31,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:31,072 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:31,072 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash 574139971, now seen corresponding path program 60 times [2019-09-03 19:55:31,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:31,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:31,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:31,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:32,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:32,677 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-03 19:55:32,688 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:32,761 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-03 19:55:32,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:32,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:55:32,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (61)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:32,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:32,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-03 19:55:32,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:55:32,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:55:32,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:55:32,797 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2019-09-03 19:55:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:32,943 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-09-03 19:55:32,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:55:32,943 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2019-09-03 19:55:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:32,944 INFO L225 Difference]: With dead ends: 139 [2019-09-03 19:55:32,944 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 19:55:32,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:55:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 19:55:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-03 19:55:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-03 19:55:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-03 19:55:32,948 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-03 19:55:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:32,949 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-03 19:55:32,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:55:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-03 19:55:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 19:55:32,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:32,950 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:32,951 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1166908287, now seen corresponding path program 61 times [2019-09-03 19:55:32,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:32,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:32,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:32,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:32,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:34,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:34,373 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-03 19:55:34,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:34,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:55:34,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-03 19:55:34,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:55:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:55:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:55:34,443 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2019-09-03 19:55:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:34,661 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-09-03 19:55:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:55:34,662 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2019-09-03 19:55:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:34,662 INFO L225 Difference]: With dead ends: 141 [2019-09-03 19:55:34,663 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:55:34,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:55:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:55:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 19:55:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 19:55:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-03 19:55:34,667 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-03 19:55:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:34,667 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-03 19:55:34,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:55:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-03 19:55:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 19:55:34,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:34,669 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:34,670 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:34,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 722961215, now seen corresponding path program 62 times [2019-09-03 19:55:34,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:34,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:34,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:36,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:36,268 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-03 19:55:36,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:36,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:36,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:36,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:55:36,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:36,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:36,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-03 19:55:36,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:55:36,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:55:36,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:55:36,335 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2019-09-03 19:55:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:36,563 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-09-03 19:55:36,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:55:36,563 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2019-09-03 19:55:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:36,564 INFO L225 Difference]: With dead ends: 143 [2019-09-03 19:55:36,564 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 19:55:36,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:55:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 19:55:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-03 19:55:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 19:55:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-03 19:55:36,569 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-03 19:55:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:36,569 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-03 19:55:36,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:55:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-03 19:55:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:55:36,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:36,571 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:36,571 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 116386429, now seen corresponding path program 63 times [2019-09-03 19:55:36,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:36,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:38,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:38,065 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-03 19:55:38,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:38,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-03 19:55:38,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:38,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:55:38,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:38,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:38,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-03 19:55:38,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:55:38,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:55:38,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:55:38,191 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2019-09-03 19:55:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:38,390 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-09-03 19:55:38,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 19:55:38,390 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-03 19:55:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:38,391 INFO L225 Difference]: With dead ends: 145 [2019-09-03 19:55:38,391 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 19:55:38,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:55:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 19:55:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-03 19:55:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 19:55:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-03 19:55:38,395 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-03 19:55:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:38,395 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-03 19:55:38,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:55:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-03 19:55:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 19:55:38,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:38,396 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:38,397 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1313569339, now seen corresponding path program 64 times [2019-09-03 19:55:38,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:38,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:40,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:40,456 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-03 19:55:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:40,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:40,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:40,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:55:40,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:40,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:40,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-03 19:55:40,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:55:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:55:40,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:55:40,529 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2019-09-03 19:55:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:40,749 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-03 19:55:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:55:40,750 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2019-09-03 19:55:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:40,750 INFO L225 Difference]: With dead ends: 147 [2019-09-03 19:55:40,750 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 19:55:40,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:55:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 19:55:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-03 19:55:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 19:55:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-03 19:55:40,756 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-03 19:55:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:40,756 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-03 19:55:40,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:55:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-03 19:55:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 19:55:40,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:40,757 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:40,757 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash 755110521, now seen corresponding path program 65 times [2019-09-03 19:55:40,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:40,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:40,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:42,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:42,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 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-03 19:55:42,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:42,579 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-03 19:55:42,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:42,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 19:55:42,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:42,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:42,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-03 19:55:42,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:55:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:55:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:55:42,616 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2019-09-03 19:55:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:42,878 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-03 19:55:42,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:55:42,878 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2019-09-03 19:55:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:42,879 INFO L225 Difference]: With dead ends: 149 [2019-09-03 19:55:42,879 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:55:42,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:55:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:55:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-03 19:55:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 19:55:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-03 19:55:42,883 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-03 19:55:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:42,884 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-03 19:55:42,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:55:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-03 19:55:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 19:55:42,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:42,885 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:42,885 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:42,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:42,885 INFO L82 PathProgramCache]: Analyzing trace with hash 947098423, now seen corresponding path program 66 times [2019-09-03 19:55:42,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:42,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:42,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:42,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:42,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:44,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:44,659 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-03 19:55:44,668 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:44,751 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-03 19:55:44,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:44,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:55:44,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:44,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:44,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-03 19:55:44,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:55:44,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:55:44,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:55:44,787 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2019-09-03 19:55:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:45,004 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-03 19:55:45,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:55:45,005 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2019-09-03 19:55:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:45,006 INFO L225 Difference]: With dead ends: 151 [2019-09-03 19:55:45,006 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 19:55:45,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:55:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 19:55:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-03 19:55:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 19:55:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-03 19:55:45,010 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-09-03 19:55:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:45,010 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-03 19:55:45,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:55:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-03 19:55:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:55:45,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:45,013 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:45,014 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash 763878517, now seen corresponding path program 67 times [2019-09-03 19:55:45,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:45,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:45,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:45,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:47,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:47,020 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-03 19:55:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:47,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 19:55:47,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:47,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:47,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-03 19:55:47,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:55:47,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:55:47,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:55:47,090 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2019-09-03 19:55:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:47,329 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-03 19:55:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 19:55:47,330 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-09-03 19:55:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:47,331 INFO L225 Difference]: With dead ends: 153 [2019-09-03 19:55:47,331 INFO L226 Difference]: Without dead ends: 148 [2019-09-03 19:55:47,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:55:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-03 19:55:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-09-03 19:55:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 19:55:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-09-03 19:55:47,335 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-09-03 19:55:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:47,335 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-09-03 19:55:47,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:55:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-09-03 19:55:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 19:55:47,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:47,337 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:47,337 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash 783207987, now seen corresponding path program 68 times [2019-09-03 19:55:47,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:47,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:49,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:49,947 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-03 19:55:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:49,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:49,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:49,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:55:49,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-03 19:55:50,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 19:55:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 19:55:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:55:50,025 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2019-09-03 19:55:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:50,279 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-03 19:55:50,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:55:50,279 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2019-09-03 19:55:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:50,280 INFO L225 Difference]: With dead ends: 155 [2019-09-03 19:55:50,281 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 19:55:50,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:55:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 19:55:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-03 19:55:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 19:55:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-09-03 19:55:50,285 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-09-03 19:55:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:50,285 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-09-03 19:55:50,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 19:55:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-09-03 19:55:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 19:55:50,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:50,286 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:50,286 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2116007823, now seen corresponding path program 69 times [2019-09-03 19:55:50,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:50,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:50,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:50,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:52,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:52,222 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-03 19:55:52,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:52,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-03 19:55:52,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:52,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:55:52,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:52,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:52,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-03 19:55:52,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:55:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:55:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:55:52,366 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2019-09-03 19:55:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:52,607 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-03 19:55:52,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 19:55:52,607 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2019-09-03 19:55:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:52,611 INFO L225 Difference]: With dead ends: 157 [2019-09-03 19:55:52,611 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 19:55:52,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:55:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 19:55:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-03 19:55:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 19:55:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-03 19:55:52,616 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-09-03 19:55:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:52,616 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-03 19:55:52,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:55:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-03 19:55:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 19:55:52,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:52,618 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:52,618 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -828626129, now seen corresponding path program 70 times [2019-09-03 19:55:52,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:52,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:52,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:54,418 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-03 19:55:54,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:54,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:54,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:54,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:55:54,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:54,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-03 19:55:54,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 19:55:54,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 19:55:54,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:55:54,490 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2019-09-03 19:55:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:54,723 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-03 19:55:54,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:55:54,723 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2019-09-03 19:55:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:54,725 INFO L225 Difference]: With dead ends: 159 [2019-09-03 19:55:54,725 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 19:55:54,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:55:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 19:55:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-03 19:55:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 19:55:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-09-03 19:55:54,730 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-09-03 19:55:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:54,731 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-09-03 19:55:54,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 19:55:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-09-03 19:55:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 19:55:54,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:54,732 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:54,732 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash -605399443, now seen corresponding path program 71 times [2019-09-03 19:55:54,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:54,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:54,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:54,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:56,629 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-03 19:55:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:56,725 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-03 19:55:56,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:56,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 19:55:56,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (72)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:56,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-03 19:55:56,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 19:55:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 19:55:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:55:56,764 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2019-09-03 19:55:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:57,072 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-03 19:55:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 19:55:57,073 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-03 19:55:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:57,074 INFO L225 Difference]: With dead ends: 161 [2019-09-03 19:55:57,074 INFO L226 Difference]: Without dead ends: 156 [2019-09-03 19:55:57,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:55:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-03 19:55:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-03 19:55:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-03 19:55:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-09-03 19:55:57,078 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-09-03 19:55:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:57,078 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-09-03 19:55:57,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 19:55:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-09-03 19:55:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-03 19:55:57,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:57,080 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:57,080 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:57,080 INFO L82 PathProgramCache]: Analyzing trace with hash -832918997, now seen corresponding path program 72 times [2019-09-03 19:55:57,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:57,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:57,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:57,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:57,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:58,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:58,956 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-03 19:55:58,965 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:59,054 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-03 19:55:59,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:59,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:55:59,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:59,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:59,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-03 19:55:59,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 19:55:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 19:55:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:55:59,082 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2019-09-03 19:55:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:59,371 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-03 19:55:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:55:59,372 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2019-09-03 19:55:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:59,373 INFO L225 Difference]: With dead ends: 163 [2019-09-03 19:55:59,373 INFO L226 Difference]: Without dead ends: 158 [2019-09-03 19:55:59,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:55:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-03 19:55:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-03 19:55:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 19:55:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-09-03 19:55:59,378 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-09-03 19:55:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:59,378 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-09-03 19:55:59,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 19:55:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-09-03 19:55:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 19:55:59,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:59,379 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:59,379 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash -435878295, now seen corresponding path program 73 times [2019-09-03 19:55:59,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:59,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:01,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:01,329 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-03 19:56:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 19:56:01,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:01,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:01,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-03 19:56:01,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 19:56:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 19:56:01,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:56:01,409 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2019-09-03 19:56:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:01,703 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-03 19:56:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:56:01,703 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2019-09-03 19:56:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:01,704 INFO L225 Difference]: With dead ends: 165 [2019-09-03 19:56:01,705 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:56:01,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:56:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:56:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-03 19:56:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 19:56:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-09-03 19:56:01,709 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-09-03 19:56:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:01,709 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-09-03 19:56:01,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 19:56:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-09-03 19:56:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 19:56:01,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:01,710 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:01,710 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1131853017, now seen corresponding path program 74 times [2019-09-03 19:56:01,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:01,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:01,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:01,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:01,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:03,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:03,656 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-03 19:56:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:03,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:03,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:03,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:56:03,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:03,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:03,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-03 19:56:03,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 19:56:03,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 19:56:03,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:56:03,735 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2019-09-03 19:56:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:04,049 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-03 19:56:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:56:04,049 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2019-09-03 19:56:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:04,050 INFO L225 Difference]: With dead ends: 167 [2019-09-03 19:56:04,050 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 19:56:04,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:56:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 19:56:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-03 19:56:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 19:56:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-09-03 19:56:04,056 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-09-03 19:56:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:04,056 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-09-03 19:56:04,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 19:56:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-09-03 19:56:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 19:56:04,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:04,057 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:04,058 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 51337317, now seen corresponding path program 75 times [2019-09-03 19:56:04,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:04,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:06,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:06,072 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-03 19:56:06,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:06,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-03 19:56:06,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:06,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:56:06,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:06,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:06,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-03 19:56:06,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 19:56:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 19:56:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:56:06,220 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2019-09-03 19:56:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:06,522 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-03 19:56:06,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 19:56:06,523 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-03 19:56:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:06,524 INFO L225 Difference]: With dead ends: 169 [2019-09-03 19:56:06,524 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 19:56:06,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:56:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 19:56:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-03 19:56:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-03 19:56:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-09-03 19:56:06,528 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-09-03 19:56:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:06,528 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-09-03 19:56:06,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 19:56:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-09-03 19:56:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-03 19:56:06,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:06,530 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:06,530 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1069085149, now seen corresponding path program 76 times [2019-09-03 19:56:06,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:06,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:06,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:06,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:06,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:08,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:08,598 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-03 19:56:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:08,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:08,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:08,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:56:08,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:08,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:08,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-03 19:56:08,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:56:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:56:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:56:08,677 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2019-09-03 19:56:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:08,937 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-03 19:56:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:56:08,937 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2019-09-03 19:56:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:08,938 INFO L225 Difference]: With dead ends: 171 [2019-09-03 19:56:08,939 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 19:56:08,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:56:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 19:56:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-03 19:56:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-03 19:56:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-09-03 19:56:08,945 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-09-03 19:56:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:08,947 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-09-03 19:56:08,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:56:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-09-03 19:56:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 19:56:08,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:08,948 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:08,948 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:08,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash 241716321, now seen corresponding path program 77 times [2019-09-03 19:56:08,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:08,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:08,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:08,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:08,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:11,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:11,052 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-03 19:56:11,061 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:11,156 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-03 19:56:11,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:11,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 19:56:11,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (78)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:11,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:11,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-03 19:56:11,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 19:56:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 19:56:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:56:11,199 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2019-09-03 19:56:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:11,455 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-03 19:56:11,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 19:56:11,456 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2019-09-03 19:56:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:11,457 INFO L225 Difference]: With dead ends: 173 [2019-09-03 19:56:11,457 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 19:56:11,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:56:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 19:56:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-03 19:56:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 19:56:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-09-03 19:56:11,461 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-09-03 19:56:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:11,462 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-09-03 19:56:11,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 19:56:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-09-03 19:56:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 19:56:11,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:11,463 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:11,463 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1496511263, now seen corresponding path program 78 times [2019-09-03 19:56:11,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:11,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:11,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:13,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:13,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 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-03 19:56:13,656 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:13,758 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-03 19:56:13,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:13,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:56:13,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:13,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:13,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-03 19:56:13,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:56:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:56:13,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:56:13,810 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2019-09-03 19:56:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:14,129 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-03 19:56:14,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:56:14,130 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2019-09-03 19:56:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:14,131 INFO L225 Difference]: With dead ends: 175 [2019-09-03 19:56:14,131 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 19:56:14,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:56:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 19:56:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-03 19:56:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 19:56:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-09-03 19:56:14,136 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-09-03 19:56:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:14,136 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-09-03 19:56:14,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:56:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-09-03 19:56:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 19:56:14,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:14,137 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:14,137 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash 468640349, now seen corresponding path program 79 times [2019-09-03 19:56:14,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:14,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:14,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:16,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:16,374 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-03 19:56:16,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:16,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 19:56:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:16,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:16,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-03 19:56:16,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:56:16,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:56:16,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:56:16,446 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2019-09-03 19:56:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:16,716 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-03 19:56:16,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 19:56:16,716 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-03 19:56:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:16,717 INFO L225 Difference]: With dead ends: 177 [2019-09-03 19:56:16,717 INFO L226 Difference]: Without dead ends: 172 [2019-09-03 19:56:16,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:56:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-03 19:56:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-03 19:56:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 19:56:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-09-03 19:56:16,720 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-09-03 19:56:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:16,720 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-09-03 19:56:16,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:56:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-09-03 19:56:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 19:56:16,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:16,722 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:16,722 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash 527170075, now seen corresponding path program 80 times [2019-09-03 19:56:16,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:16,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:18,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:18,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 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-03 19:56:18,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:19,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:19,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:19,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:56:19,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-03 19:56:19,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 19:56:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 19:56:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:56:19,063 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2019-09-03 19:56:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:19,326 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-03 19:56:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:56:19,327 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2019-09-03 19:56:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:19,328 INFO L225 Difference]: With dead ends: 179 [2019-09-03 19:56:19,328 INFO L226 Difference]: Without dead ends: 174 [2019-09-03 19:56:19,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:56:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-03 19:56:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-03 19:56:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-03 19:56:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-09-03 19:56:19,333 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-09-03 19:56:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:19,333 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-09-03 19:56:19,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 19:56:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-09-03 19:56:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 19:56:19,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:19,335 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:19,335 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash 939661913, now seen corresponding path program 81 times [2019-09-03 19:56:19,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:19,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:19,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:19,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:19,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:21,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:21,700 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-03 19:56:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:21,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-03 19:56:21,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:21,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 19:56:21,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:21,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:21,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-03 19:56:21,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 19:56:21,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 19:56:21,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:56:21,834 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2019-09-03 19:56:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:22,190 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-03 19:56:22,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:56:22,190 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2019-09-03 19:56:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:22,191 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:56:22,191 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 19:56:22,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:56:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 19:56:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-03 19:56:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 19:56:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-09-03 19:56:22,195 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-09-03 19:56:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:22,196 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-09-03 19:56:22,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 19:56:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-09-03 19:56:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 19:56:22,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:22,197 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:22,197 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2087640297, now seen corresponding path program 82 times [2019-09-03 19:56:22,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:22,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:22,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:24,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:24,637 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-03 19:56:24,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:24,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:24,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:24,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:56:24,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:24,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:24,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-03 19:56:24,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 19:56:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 19:56:24,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:56:24,729 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2019-09-03 19:56:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:25,050 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-03 19:56:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 19:56:25,050 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-09-03 19:56:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:25,051 INFO L225 Difference]: With dead ends: 183 [2019-09-03 19:56:25,051 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 19:56:25,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:56:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 19:56:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-03 19:56:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 19:56:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-09-03 19:56:25,055 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-09-03 19:56:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:25,056 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-09-03 19:56:25,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 19:56:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-09-03 19:56:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 19:56:25,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:25,057 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:25,057 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:25,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash 662762581, now seen corresponding path program 83 times [2019-09-03 19:56:25,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:25,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:25,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:25,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:27,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:27,489 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-03 19:56:27,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:27,606 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-03 19:56:27,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:27,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 19:56:27,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:27,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:27,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-03 19:56:27,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 19:56:27,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 19:56:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:56:27,640 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2019-09-03 19:56:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:27,999 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-03 19:56:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 19:56:28,000 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-03 19:56:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:28,001 INFO L225 Difference]: With dead ends: 185 [2019-09-03 19:56:28,001 INFO L226 Difference]: Without dead ends: 180 [2019-09-03 19:56:28,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:56:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-03 19:56:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-03 19:56:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 19:56:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-09-03 19:56:28,004 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-09-03 19:56:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:28,004 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-09-03 19:56:28,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 19:56:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-09-03 19:56:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 19:56:28,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:28,006 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:28,006 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1899925997, now seen corresponding path program 84 times [2019-09-03 19:56:28,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:28,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:30,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:30,506 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-03 19:56:30,516 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:30,626 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-03 19:56:30,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:30,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:56:30,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:30,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:30,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-03 19:56:30,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 19:56:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 19:56:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:56:30,662 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2019-09-03 19:56:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:31,042 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-03 19:56:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:56:31,042 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2019-09-03 19:56:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:31,043 INFO L225 Difference]: With dead ends: 187 [2019-09-03 19:56:31,044 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 19:56:31,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:56:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 19:56:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-03 19:56:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 19:56:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-09-03 19:56:31,048 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-09-03 19:56:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:31,049 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-09-03 19:56:31,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 19:56:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-09-03 19:56:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 19:56:31,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:31,050 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:31,050 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 667578449, now seen corresponding path program 85 times [2019-09-03 19:56:31,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:31,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:31,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:31,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:33,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:33,598 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-03 19:56:33,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:33,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 19:56:33,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:33,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:33,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-03 19:56:33,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 19:56:33,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 19:56:33,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:56:33,675 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2019-09-03 19:56:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:34,060 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-03 19:56:34,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 19:56:34,060 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2019-09-03 19:56:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:34,061 INFO L225 Difference]: With dead ends: 189 [2019-09-03 19:56:34,061 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 19:56:34,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:56:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 19:56:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-03 19:56:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 19:56:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-09-03 19:56:34,066 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-09-03 19:56:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:34,066 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-09-03 19:56:34,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 19:56:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-09-03 19:56:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 19:56:34,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:34,068 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:34,068 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:34,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1566844145, now seen corresponding path program 86 times [2019-09-03 19:56:34,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:34,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:36,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:36,669 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-03 19:56:36,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:36,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:36,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:36,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:56:36,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:36,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:36,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-03 19:56:36,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 19:56:36,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 19:56:36,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:56:36,751 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2019-09-03 19:56:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:37,052 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-03 19:56:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:56:37,053 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2019-09-03 19:56:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:37,054 INFO L225 Difference]: With dead ends: 191 [2019-09-03 19:56:37,054 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 19:56:37,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:56:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 19:56:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-03 19:56:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 19:56:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-09-03 19:56:37,059 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-09-03 19:56:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:37,060 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-09-03 19:56:37,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 19:56:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-09-03 19:56:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-03 19:56:37,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:37,061 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:37,061 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1363308979, now seen corresponding path program 87 times [2019-09-03 19:56:37,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:37,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:37,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:37,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:39,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:39,753 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-03 19:56:39,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:39,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-03 19:56:39,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:39,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 19:56:39,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:39,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:39,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-03 19:56:39,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 19:56:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 19:56:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:56:39,920 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2019-09-03 19:56:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:40,248 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-03 19:56:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 19:56:40,248 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2019-09-03 19:56:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:40,249 INFO L225 Difference]: With dead ends: 193 [2019-09-03 19:56:40,249 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 19:56:40,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:56:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 19:56:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-03 19:56:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 19:56:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-09-03 19:56:40,253 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-09-03 19:56:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:40,254 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-09-03 19:56:40,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 19:56:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-09-03 19:56:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 19:56:40,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:40,255 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:40,255 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 960457227, now seen corresponding path program 88 times [2019-09-03 19:56:40,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:40,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:40,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:42,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:42,995 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-03 19:56:43,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:43,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:43,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:43,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:56:43,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:43,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:43,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-03 19:56:43,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 19:56:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 19:56:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:56:43,069 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2019-09-03 19:56:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:43,464 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-03 19:56:43,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 19:56:43,464 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2019-09-03 19:56:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:43,465 INFO L225 Difference]: With dead ends: 195 [2019-09-03 19:56:43,465 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 19:56:43,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:56:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 19:56:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-03 19:56:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 19:56:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-09-03 19:56:43,468 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-09-03 19:56:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:43,469 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-09-03 19:56:43,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 19:56:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-09-03 19:56:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 19:56:43,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:43,470 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:43,470 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash 716787273, now seen corresponding path program 89 times [2019-09-03 19:56:43,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:43,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:43,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:43,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:43,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:46,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:46,280 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-03 19:56:46,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:46,405 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-03 19:56:46,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:46,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 19:56:46,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:46,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:46,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-03 19:56:46,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 19:56:46,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 19:56:46,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:56:46,442 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 92 states. [2019-09-03 19:56:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:46,787 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-03 19:56:46,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 19:56:46,788 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2019-09-03 19:56:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:46,789 INFO L225 Difference]: With dead ends: 197 [2019-09-03 19:56:46,789 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 19:56:46,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:56:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 19:56:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-03 19:56:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 19:56:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-09-03 19:56:46,792 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-09-03 19:56:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:46,792 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-09-03 19:56:46,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 19:56:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-09-03 19:56:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 19:56:46,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:46,793 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:46,793 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:46,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:46,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1521804537, now seen corresponding path program 90 times [2019-09-03 19:56:46,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:46,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:46,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:46,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:46,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:49,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:49,658 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-03 19:56:49,667 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:49,789 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-03 19:56:49,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:49,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:56:49,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:49,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:49,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-03 19:56:49,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 19:56:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 19:56:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:56:49,825 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 93 states. [2019-09-03 19:56:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:50,136 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-03 19:56:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:56:50,136 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2019-09-03 19:56:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:50,138 INFO L225 Difference]: With dead ends: 199 [2019-09-03 19:56:50,138 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 19:56:50,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:56:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 19:56:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-03 19:56:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 19:56:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-09-03 19:56:50,142 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-09-03 19:56:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:50,142 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-09-03 19:56:50,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 19:56:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-09-03 19:56:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 19:56:50,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:50,143 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:50,144 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:50,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1029918651, now seen corresponding path program 91 times [2019-09-03 19:56:50,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:50,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:50,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:53,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:53,043 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-03 19:56:53,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:53,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 19:56:53,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:53,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:53,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-03 19:56:53,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 19:56:53,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 19:56:53,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:56:53,127 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 94 states. [2019-09-03 19:56:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:53,535 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-03 19:56:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 19:56:53,535 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2019-09-03 19:56:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:53,536 INFO L225 Difference]: With dead ends: 201 [2019-09-03 19:56:53,536 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 19:56:53,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:56:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 19:56:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-03 19:56:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 19:56:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-09-03 19:56:53,539 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-09-03 19:56:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:53,540 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-09-03 19:56:53,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 19:56:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-09-03 19:56:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-03 19:56:53,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:53,541 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:53,541 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash -773984765, now seen corresponding path program 92 times [2019-09-03 19:56:53,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:53,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:53,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:56,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:56,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:56,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:56,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:56,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:56,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:56:56,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:56,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:56,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-03 19:56:56,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 19:56:56,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 19:56:56,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:56:56,600 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 95 states. [2019-09-03 19:56:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:57,032 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-03 19:56:57,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:56:57,032 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-03 19:56:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:57,033 INFO L225 Difference]: With dead ends: 203 [2019-09-03 19:56:57,033 INFO L226 Difference]: Without dead ends: 198 [2019-09-03 19:56:57,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:56:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-03 19:56:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-03 19:56:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 19:56:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-09-03 19:56:57,037 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-09-03 19:56:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:57,037 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-09-03 19:56:57,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 19:56:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-09-03 19:56:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 19:56:57,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:57,039 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:57,039 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash 365343809, now seen corresponding path program 93 times [2019-09-03 19:56:57,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:57,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:57,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:57,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:57,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:00,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:00,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:00,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:00,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-03 19:57:00,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:00,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 19:57:00,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:00,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:00,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-03 19:57:00,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 19:57:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 19:57:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:57:00,273 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 96 states. [2019-09-03 19:57:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:00,733 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-03 19:57:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 19:57:00,733 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2019-09-03 19:57:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:00,734 INFO L225 Difference]: With dead ends: 205 [2019-09-03 19:57:00,734 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 19:57:00,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:57:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 19:57:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-03 19:57:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 19:57:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-09-03 19:57:00,739 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-09-03 19:57:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:00,739 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-09-03 19:57:00,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 19:57:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-09-03 19:57:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 19:57:00,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:00,740 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:00,741 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash 43442943, now seen corresponding path program 94 times [2019-09-03 19:57:00,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:00,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:00,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:03,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:03,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:03,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:03,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:03,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:03,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:57:03,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:03,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:03,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-03 19:57:03,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 19:57:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 19:57:03,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:57:03,968 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 97 states. [2019-09-03 19:57:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:04,421 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-03 19:57:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:57:04,421 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2019-09-03 19:57:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:04,422 INFO L225 Difference]: With dead ends: 207 [2019-09-03 19:57:04,422 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 19:57:04,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:57:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 19:57:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-03 19:57:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 19:57:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-09-03 19:57:04,426 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-09-03 19:57:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:04,427 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-09-03 19:57:04,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 19:57:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-09-03 19:57:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-03 19:57:04,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:04,428 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:04,428 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash -65643971, now seen corresponding path program 95 times [2019-09-03 19:57:04,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:04,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:04,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:04,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:07,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:07,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:07,678 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-03 19:57:07,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:07,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 19:57:07,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:07,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:07,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-03 19:57:07,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 19:57:07,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 19:57:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:57:07,725 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 98 states. [2019-09-03 19:57:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:08,083 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-03 19:57:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 19:57:08,083 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2019-09-03 19:57:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:08,085 INFO L225 Difference]: With dead ends: 209 [2019-09-03 19:57:08,085 INFO L226 Difference]: Without dead ends: 204 [2019-09-03 19:57:08,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:57:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-03 19:57:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-03 19:57:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 19:57:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-09-03 19:57:08,090 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-09-03 19:57:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:08,090 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-09-03 19:57:08,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 19:57:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-09-03 19:57:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 19:57:08,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:08,092 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:08,092 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1818953221, now seen corresponding path program 96 times [2019-09-03 19:57:08,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:08,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:08,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:11,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:11,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:11,335 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:11,481 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-03 19:57:11,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:11,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:57:11,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:11,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:11,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-03 19:57:11,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:57:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:57:11,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:57:11,522 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 99 states. [2019-09-03 19:57:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:11,847 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-09-03 19:57:11,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:57:11,847 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-03 19:57:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:11,848 INFO L225 Difference]: With dead ends: 211 [2019-09-03 19:57:11,848 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 19:57:11,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:57:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 19:57:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-03 19:57:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 19:57:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-09-03 19:57:11,852 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-09-03 19:57:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:11,852 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-09-03 19:57:11,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:57:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-09-03 19:57:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 19:57:11,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:11,853 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:11,853 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1173004857, now seen corresponding path program 97 times [2019-09-03 19:57:11,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:11,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:11,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:15,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:15,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:15,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:15,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 19:57:15,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:15,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:15,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-03 19:57:15,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 19:57:15,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 19:57:15,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:57:15,190 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 100 states. [2019-09-03 19:57:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:15,624 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-09-03 19:57:15,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 19:57:15,624 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2019-09-03 19:57:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:15,625 INFO L225 Difference]: With dead ends: 213 [2019-09-03 19:57:15,626 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 19:57:15,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:57:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 19:57:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-03 19:57:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 19:57:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-09-03 19:57:15,629 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-09-03 19:57:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:15,629 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-09-03 19:57:15,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 19:57:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-09-03 19:57:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 19:57:15,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:15,631 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:15,631 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1183370505, now seen corresponding path program 98 times [2019-09-03 19:57:15,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:15,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:19,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:19,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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:19,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:19,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:19,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:19,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:57:19,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:19,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:19,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-03 19:57:19,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 19:57:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 19:57:19,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:57:19,127 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 101 states. [2019-09-03 19:57:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:19,511 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-09-03 19:57:19,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 19:57:19,512 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2019-09-03 19:57:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:19,513 INFO L225 Difference]: With dead ends: 215 [2019-09-03 19:57:19,513 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 19:57:19,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:57:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 19:57:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-03 19:57:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 19:57:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-09-03 19:57:19,516 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-09-03 19:57:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:19,516 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-09-03 19:57:19,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 19:57:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-09-03 19:57:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-03 19:57:19,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:19,518 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:19,518 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2082638901, now seen corresponding path program 99 times [2019-09-03 19:57:19,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:19,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:22,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:22,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:22,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:23,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-03 19:57:23,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:23,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 19:57:23,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:23,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:23,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-03 19:57:23,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 19:57:23,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 19:57:23,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:57:23,139 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 102 states. [2019-09-03 19:57:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:23,609 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-09-03 19:57:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 19:57:23,610 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-03 19:57:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:23,611 INFO L225 Difference]: With dead ends: 217 [2019-09-03 19:57:23,611 INFO L226 Difference]: Without dead ends: 212 [2019-09-03 19:57:23,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:57:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-03 19:57:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-09-03 19:57:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 19:57:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-09-03 19:57:23,616 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-09-03 19:57:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:23,616 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-09-03 19:57:23,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 19:57:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-09-03 19:57:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 19:57:23,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:23,618 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:23,618 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1096584691, now seen corresponding path program 100 times [2019-09-03 19:57:23,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:23,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:23,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:27,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:27,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:27,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:27,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:27,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:57:27,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:27,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:27,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-03 19:57:27,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 19:57:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 19:57:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:57:27,222 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 103 states. [2019-09-03 19:57:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:27,585 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-09-03 19:57:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 19:57:27,585 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 210 [2019-09-03 19:57:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:27,587 INFO L225 Difference]: With dead ends: 219 [2019-09-03 19:57:27,587 INFO L226 Difference]: Without dead ends: 214 [2019-09-03 19:57:27,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:57:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-03 19:57:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-03 19:57:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 19:57:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-09-03 19:57:27,591 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2019-09-03 19:57:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:27,592 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-09-03 19:57:27,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 19:57:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-09-03 19:57:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 19:57:27,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:27,593 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:27,593 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:27,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1608705999, now seen corresponding path program 101 times [2019-09-03 19:57:27,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:27,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:27,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:27,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:27,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:31,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:31,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:31,169 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:31,301 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2019-09-03 19:57:31,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:31,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 19:57:31,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:31,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:31,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-09-03 19:57:31,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 19:57:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 19:57:31,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:57:31,369 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 104 states. [2019-09-03 19:57:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:31,776 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-09-03 19:57:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 19:57:31,777 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 212 [2019-09-03 19:57:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:31,777 INFO L225 Difference]: With dead ends: 221 [2019-09-03 19:57:31,777 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 19:57:31,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:57:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 19:57:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-03 19:57:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 19:57:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-09-03 19:57:31,782 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2019-09-03 19:57:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:31,782 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-09-03 19:57:31,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 19:57:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-09-03 19:57:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 19:57:31,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:31,784 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:31,784 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:31,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1357122287, now seen corresponding path program 102 times [2019-09-03 19:57:31,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:31,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:31,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:31,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:31,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:35,409 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-03 19:57:35,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:35,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:35,419 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:35,562 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2019-09-03 19:57:35,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:35,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:57:35,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:35,600 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-03 19:57:35,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:35,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-03 19:57:35,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 19:57:35,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 19:57:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:57:35,606 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 105 states. [2019-09-03 19:57:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:35,946 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-09-03 19:57:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 19:57:35,946 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 214 [2019-09-03 19:57:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:35,947 INFO L225 Difference]: With dead ends: 223 [2019-09-03 19:57:35,947 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 19:57:35,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:57:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 19:57:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-03 19:57:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 19:57:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-09-03 19:57:35,952 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2019-09-03 19:57:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:35,952 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-09-03 19:57:35,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 19:57:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-09-03 19:57:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-03 19:57:35,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:35,954 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:35,954 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash -340179411, now seen corresponding path program 103 times [2019-09-03 19:57:35,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:35,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:35,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:35,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:35,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:39,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:39,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:39,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:39,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 19:57:39,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:39,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:39,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-09-03 19:57:39,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 19:57:39,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 19:57:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:57:39,727 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 106 states. [2019-09-03 19:57:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:40,193 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-09-03 19:57:40,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 19:57:40,194 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 216 [2019-09-03 19:57:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:40,194 INFO L225 Difference]: With dead ends: 225 [2019-09-03 19:57:40,194 INFO L226 Difference]: Without dead ends: 220 [2019-09-03 19:57:40,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:57:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-03 19:57:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-09-03 19:57:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 19:57:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-09-03 19:57:40,198 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2019-09-03 19:57:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:40,199 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2019-09-03 19:57:40,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 19:57:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2019-09-03 19:57:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-03 19:57:40,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:40,209 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:40,209 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:40,209 INFO L82 PathProgramCache]: Analyzing trace with hash 640461291, now seen corresponding path program 104 times [2019-09-03 19:57:40,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:40,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:43,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:43,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:44,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:44,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:44,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:57:44,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (105)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:57:44,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:44,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-03 19:57:44,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 19:57:44,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 19:57:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 19:57:44,060 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 107 states. [2019-09-03 19:57:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:44,411 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-09-03 19:57:44,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 19:57:44,411 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 218 [2019-09-03 19:57:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:44,412 INFO L225 Difference]: With dead ends: 227 [2019-09-03 19:57:44,412 INFO L226 Difference]: Without dead ends: 222 [2019-09-03 19:57:44,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 19:57:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-03 19:57:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-09-03 19:57:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-03 19:57:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-09-03 19:57:44,417 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2019-09-03 19:57:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:44,417 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-09-03 19:57:44,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 19:57:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-09-03 19:57:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 19:57:44,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:44,419 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:44,419 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1856629207, now seen corresponding path program 105 times [2019-09-03 19:57:44,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:44,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:48,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:48,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:48,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:48,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2019-09-03 19:57:48,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:48,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-03 19:57:48,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (106)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:57:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-09-03 19:57:48,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 19:57:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 19:57:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:57:48,483 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 108 states. [2019-09-03 19:57:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:48,902 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-09-03 19:57:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 19:57:48,902 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 220 [2019-09-03 19:57:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:48,903 INFO L225 Difference]: With dead ends: 229 [2019-09-03 19:57:48,903 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 19:57:48,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:57:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 19:57:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-03 19:57:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 19:57:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-09-03 19:57:48,907 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2019-09-03 19:57:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:48,907 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-09-03 19:57:48,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 19:57:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-09-03 19:57:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 19:57:48,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:48,908 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:48,909 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash -673879321, now seen corresponding path program 106 times [2019-09-03 19:57:48,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:48,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:48,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:48,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:48,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:52,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:52,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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:52,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:52,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:52,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:52,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:57:52,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:52,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:52,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-03 19:57:52,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 19:57:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 19:57:52,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:57:52,877 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 109 states. [2019-09-03 19:57:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:53,296 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-09-03 19:57:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 19:57:53,296 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 222 [2019-09-03 19:57:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:53,297 INFO L225 Difference]: With dead ends: 231 [2019-09-03 19:57:53,297 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 19:57:53,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:57:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 19:57:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-09-03 19:57:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-03 19:57:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-09-03 19:57:53,300 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2019-09-03 19:57:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:53,301 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-09-03 19:57:53,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 19:57:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-09-03 19:57:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-03 19:57:53,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:53,302 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:53,302 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2077394981, now seen corresponding path program 107 times [2019-09-03 19:57:53,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:53,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:53,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:53,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:53,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:57,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:57,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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:57,250 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:57,396 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2019-09-03 19:57:57,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:57,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 19:57:57,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:57,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-09-03 19:57:57,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-03 19:57:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-03 19:57:57,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:57:57,449 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 110 states. [2019-09-03 19:57:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:57,870 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-09-03 19:57:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-03 19:57:57,870 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 224 [2019-09-03 19:57:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:57,871 INFO L225 Difference]: With dead ends: 233 [2019-09-03 19:57:57,871 INFO L226 Difference]: Without dead ends: 228 [2019-09-03 19:57:57,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:57:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-03 19:57:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-09-03 19:57:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 19:57:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-09-03 19:57:57,875 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2019-09-03 19:57:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:57,876 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-09-03 19:57:57,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-03 19:57:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-09-03 19:57:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-03 19:57:57,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:57,876 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:57,877 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash 352144867, now seen corresponding path program 108 times [2019-09-03 19:57:57,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:57,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:57,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:57,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:01,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:01,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:01,929 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:02,084 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2019-09-03 19:58:02,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:02,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:58:02,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:02,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:02,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-03 19:58:02,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 19:58:02,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 19:58:02,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:58:02,132 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 111 states. [2019-09-03 19:58:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:02,622 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-09-03 19:58:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 19:58:02,622 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 226 [2019-09-03 19:58:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:02,623 INFO L225 Difference]: With dead ends: 235 [2019-09-03 19:58:02,623 INFO L226 Difference]: Without dead ends: 230 [2019-09-03 19:58:02,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:58:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-03 19:58:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-03 19:58:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-03 19:58:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-09-03 19:58:02,627 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2019-09-03 19:58:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:02,627 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-09-03 19:58:02,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 19:58:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-09-03 19:58:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 19:58:02,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:02,628 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:02,628 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 244161569, now seen corresponding path program 109 times [2019-09-03 19:58:02,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:02,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:02,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:06,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:06,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:06,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:06,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 19:58:06,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:06,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:06,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-09-03 19:58:06,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 19:58:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 19:58:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:58:06,913 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 112 states. [2019-09-03 19:58:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:07,411 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-09-03 19:58:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 19:58:07,411 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 228 [2019-09-03 19:58:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:07,412 INFO L225 Difference]: With dead ends: 237 [2019-09-03 19:58:07,412 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 19:58:07,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:58:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 19:58:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-09-03 19:58:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 19:58:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-09-03 19:58:07,415 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2019-09-03 19:58:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:07,415 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-09-03 19:58:07,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 19:58:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-09-03 19:58:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-03 19:58:07,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:07,416 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:07,416 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash -448572705, now seen corresponding path program 110 times [2019-09-03 19:58:07,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:07,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:07,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:11,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:11,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:11,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:11,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:11,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:11,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:58:11,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:11,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:11,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-03 19:58:11,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 19:58:11,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 19:58:11,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:58:11,894 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 113 states. [2019-09-03 19:58:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:12,459 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-09-03 19:58:12,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 19:58:12,459 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 230 [2019-09-03 19:58:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:12,460 INFO L225 Difference]: With dead ends: 239 [2019-09-03 19:58:12,460 INFO L226 Difference]: Without dead ends: 234 [2019-09-03 19:58:12,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:58:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-03 19:58:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-09-03 19:58:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 19:58:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-09-03 19:58:12,463 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2019-09-03 19:58:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:12,463 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-09-03 19:58:12,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 19:58:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-09-03 19:58:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-03 19:58:12,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:12,464 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:12,464 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash -446279139, now seen corresponding path program 111 times [2019-09-03 19:58:12,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:12,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:12,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:12,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:12,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:16,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:16,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:16,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:16,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2019-09-03 19:58:16,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:16,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-03 19:58:16,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:16,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:16,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-09-03 19:58:16,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-03 19:58:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-03 19:58:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 19:58:16,948 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 114 states. [2019-09-03 19:58:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:17,388 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-09-03 19:58:17,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-03 19:58:17,388 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 232 [2019-09-03 19:58:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:17,389 INFO L225 Difference]: With dead ends: 241 [2019-09-03 19:58:17,389 INFO L226 Difference]: Without dead ends: 236 [2019-09-03 19:58:17,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 19:58:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-03 19:58:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-09-03 19:58:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-03 19:58:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-09-03 19:58:17,392 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2019-09-03 19:58:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:17,392 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-09-03 19:58:17,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-03 19:58:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-09-03 19:58:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-03 19:58:17,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:17,394 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:17,394 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1757837787, now seen corresponding path program 112 times [2019-09-03 19:58:17,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:17,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:17,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:21,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:21,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:21,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:21,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:21,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:21,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:58:21,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:21,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:21,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-03 19:58:21,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 19:58:21,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 19:58:21,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:58:21,837 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 115 states. [2019-09-03 19:58:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:22,325 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-09-03 19:58:22,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 19:58:22,326 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 234 [2019-09-03 19:58:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:22,326 INFO L225 Difference]: With dead ends: 243 [2019-09-03 19:58:22,327 INFO L226 Difference]: Without dead ends: 238 [2019-09-03 19:58:22,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:58:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-03 19:58:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-09-03 19:58:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-03 19:58:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-09-03 19:58:22,330 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2019-09-03 19:58:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:22,331 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-09-03 19:58:22,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 19:58:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-09-03 19:58:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 19:58:22,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:22,331 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:22,331 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1799640551, now seen corresponding path program 113 times [2019-09-03 19:58:22,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:22,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:22,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:22,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:26,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:26,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:26,907 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2019-09-03 19:58:26,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:26,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-03 19:58:26,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:26,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:26,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-09-03 19:58:26,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-03 19:58:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-03 19:58:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 19:58:26,963 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 116 states. [2019-09-03 19:58:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:27,421 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-09-03 19:58:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 19:58:27,422 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 236 [2019-09-03 19:58:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:27,422 INFO L225 Difference]: With dead ends: 245 [2019-09-03 19:58:27,422 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 19:58:27,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 19:58:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 19:58:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-09-03 19:58:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 19:58:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-09-03 19:58:27,426 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2019-09-03 19:58:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:27,426 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-09-03 19:58:27,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-03 19:58:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-09-03 19:58:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-03 19:58:27,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:27,427 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:27,427 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:27,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1742355753, now seen corresponding path program 114 times [2019-09-03 19:58:27,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:27,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:27,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:27,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:27,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:31,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:31,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:31,917 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:32,082 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2019-09-03 19:58:32,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:32,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:58:32,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:32,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:32,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-03 19:58:32,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 19:58:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 19:58:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:58:32,139 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 117 states. [2019-09-03 19:58:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:32,714 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-09-03 19:58:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 19:58:32,715 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 238 [2019-09-03 19:58:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:32,715 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:58:32,715 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 19:58:32,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:58:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 19:58:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-09-03 19:58:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-03 19:58:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-09-03 19:58:32,718 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2019-09-03 19:58:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:32,719 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-09-03 19:58:32,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 19:58:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-09-03 19:58:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-03 19:58:32,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:32,720 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:32,720 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1768727573, now seen corresponding path program 115 times [2019-09-03 19:58:32,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:32,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:32,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:32,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:32,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:37,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:37,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:37,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:37,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-03 19:58:37,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:37,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:37,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-09-03 19:58:37,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-03 19:58:37,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-03 19:58:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:58:37,375 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 118 states. [2019-09-03 19:58:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:37,996 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-09-03 19:58:37,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-03 19:58:37,996 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 240 [2019-09-03 19:58:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:37,997 INFO L225 Difference]: With dead ends: 249 [2019-09-03 19:58:37,997 INFO L226 Difference]: Without dead ends: 244 [2019-09-03 19:58:37,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:58:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-03 19:58:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2019-09-03 19:58:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-03 19:58:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-09-03 19:58:38,000 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2019-09-03 19:58:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:38,000 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2019-09-03 19:58:38,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-03 19:58:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2019-09-03 19:58:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-03 19:58:38,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:38,002 INFO L399 BasicCegarLoop]: trace histogram [116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:38,002 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash 75509203, now seen corresponding path program 116 times [2019-09-03 19:58:38,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:38,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:38,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:38,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:38,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:42,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:42,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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:42,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:42,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:42,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 19:58:42,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:42,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:42,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-03 19:58:42,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-03 19:58:42,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-03 19:58:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 19:58:42,715 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 119 states. [2019-09-03 19:58:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:43,291 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-09-03 19:58:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 19:58:43,291 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 242 [2019-09-03 19:58:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:43,292 INFO L225 Difference]: With dead ends: 251 [2019-09-03 19:58:43,292 INFO L226 Difference]: Without dead ends: 246 [2019-09-03 19:58:43,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 19:58:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-03 19:58:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-09-03 19:58:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-03 19:58:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-09-03 19:58:43,296 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2019-09-03 19:58:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:43,297 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-09-03 19:58:43,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-03 19:58:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-09-03 19:58:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-03 19:58:43,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:43,297 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:43,298 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash 685260817, now seen corresponding path program 117 times [2019-09-03 19:58:43,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:43,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:43,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:47,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:47,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:48,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2019-09-03 19:58:48,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:48,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-03 19:58:48,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:48,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:48,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-09-03 19:58:48,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-03 19:58:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-03 19:58:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 19:58:48,237 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 120 states. [2019-09-03 19:58:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:48,824 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-09-03 19:58:48,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-03 19:58:48,825 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 244 [2019-09-03 19:58:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:48,825 INFO L225 Difference]: With dead ends: 253 [2019-09-03 19:58:48,826 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 19:58:48,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 19:58:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 19:58:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-09-03 19:58:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-03 19:58:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-09-03 19:58:48,829 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2019-09-03 19:58:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:48,830 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-09-03 19:58:48,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-03 19:58:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-09-03 19:58:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-03 19:58:48,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:48,831 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:48,831 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1753957681, now seen corresponding path program 118 times [2019-09-03 19:58:48,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:48,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:48,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:48,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:53,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:53,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:53,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:53,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:58:53,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:53,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-03 19:58:53,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 19:58:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 19:58:53,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:58:53,821 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 121 states. [2019-09-03 19:58:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:54,297 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-09-03 19:58:54,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 19:58:54,298 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 246 [2019-09-03 19:58:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:54,299 INFO L225 Difference]: With dead ends: 255 [2019-09-03 19:58:54,299 INFO L226 Difference]: Without dead ends: 250 [2019-09-03 19:58:54,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:58:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-03 19:58:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-09-03 19:58:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-03 19:58:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-09-03 19:58:54,304 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2019-09-03 19:58:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:54,304 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-09-03 19:58:54,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 19:58:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-09-03 19:58:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-03 19:58:54,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:54,305 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:54,305 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash -790790643, now seen corresponding path program 119 times [2019-09-03 19:58:54,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:54,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:54,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:59,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:59,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:59,189 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:59,360 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2019-09-03 19:58:59,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:59,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-03 19:58:59,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2019-09-03 19:58:59,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-03 19:58:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-03 19:58:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:58:59,417 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 122 states. [2019-09-03 19:59:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:00,065 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2019-09-03 19:59:00,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-03 19:59:00,066 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 248 [2019-09-03 19:59:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:00,067 INFO L225 Difference]: With dead ends: 257 [2019-09-03 19:59:00,067 INFO L226 Difference]: Without dead ends: 252 [2019-09-03 19:59:00,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:59:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-03 19:59:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-09-03 19:59:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-03 19:59:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-09-03 19:59:00,071 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2019-09-03 19:59:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:00,071 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-09-03 19:59:00,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-03 19:59:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-09-03 19:59:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-03 19:59:00,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:00,073 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:00,073 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1394764235, now seen corresponding path program 120 times [2019-09-03 19:59:00,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:00,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:00,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:05,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:05,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:05,177 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:05,359 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2019-09-03 19:59:05,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:05,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:59:05,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:05,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:05,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-03 19:59:05,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 19:59:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 19:59:05,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 19:59:05,414 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 123 states. [2019-09-03 19:59:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:05,994 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-09-03 19:59:05,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-03 19:59:05,994 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 250 [2019-09-03 19:59:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:05,995 INFO L225 Difference]: With dead ends: 259 [2019-09-03 19:59:05,995 INFO L226 Difference]: Without dead ends: 254 [2019-09-03 19:59:05,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 19:59:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-03 19:59:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-09-03 19:59:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-03 19:59:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-09-03 19:59:05,998 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2019-09-03 19:59:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:05,999 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-09-03 19:59:05,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 19:59:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-09-03 19:59:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 19:59:05,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:06,000 INFO L399 BasicCegarLoop]: trace histogram [121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:06,000 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1473994249, now seen corresponding path program 121 times [2019-09-03 19:59:06,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:06,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:11,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:11,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:11,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:11,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 19:59:11,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:11,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:11,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2019-09-03 19:59:11,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 19:59:11,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 19:59:11,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:59:11,153 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 124 states. [2019-09-03 19:59:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:11,636 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-09-03 19:59:11,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-03 19:59:11,636 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 252 [2019-09-03 19:59:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:11,637 INFO L225 Difference]: With dead ends: 261 [2019-09-03 19:59:11,637 INFO L226 Difference]: Without dead ends: 256 [2019-09-03 19:59:11,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:59:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-03 19:59:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-09-03 19:59:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 19:59:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-09-03 19:59:11,644 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2019-09-03 19:59:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:11,644 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2019-09-03 19:59:11,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 19:59:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2019-09-03 19:59:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-03 19:59:11,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:11,645 INFO L399 BasicCegarLoop]: trace histogram [122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:11,646 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash 304626375, now seen corresponding path program 122 times [2019-09-03 19:59:11,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:11,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:16,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:16,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:16,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:16,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:16,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:16,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 19:59:16,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:16,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:16,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-03 19:59:16,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-03 19:59:16,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-03 19:59:16,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 19:59:16,910 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 125 states. [2019-09-03 19:59:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:17,585 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-09-03 19:59:17,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 19:59:17,585 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 254 [2019-09-03 19:59:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:17,586 INFO L225 Difference]: With dead ends: 263 [2019-09-03 19:59:17,586 INFO L226 Difference]: Without dead ends: 258 [2019-09-03 19:59:17,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 19:59:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-03 19:59:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-09-03 19:59:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-03 19:59:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-09-03 19:59:17,589 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2019-09-03 19:59:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:17,589 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-09-03 19:59:17,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-03 19:59:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-09-03 19:59:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-03 19:59:17,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:17,590 INFO L399 BasicCegarLoop]: trace histogram [123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:17,590 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:17,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1823531013, now seen corresponding path program 123 times [2019-09-03 19:59:17,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:17,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:17,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:22,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:22,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:22,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:23,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2019-09-03 19:59:23,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:23,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-03 19:59:23,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:23,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:23,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2019-09-03 19:59:23,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-03 19:59:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-03 19:59:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 19:59:23,069 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 126 states. [2019-09-03 19:59:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:23,522 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-09-03 19:59:23,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-03 19:59:23,523 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 256 [2019-09-03 19:59:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:23,523 INFO L225 Difference]: With dead ends: 265 [2019-09-03 19:59:23,524 INFO L226 Difference]: Without dead ends: 260 [2019-09-03 19:59:23,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 19:59:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-03 19:59:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-09-03 19:59:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-03 19:59:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-09-03 19:59:23,527 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2019-09-03 19:59:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:23,527 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-09-03 19:59:23,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-03 19:59:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-09-03 19:59:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 19:59:23,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:23,528 INFO L399 BasicCegarLoop]: trace histogram [124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:23,529 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1202007491, now seen corresponding path program 124 times [2019-09-03 19:59:23,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:23,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:28,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:28,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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:28,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:29,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:29,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:29,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 19:59:29,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (125)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:59:29,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:29,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-03 19:59:29,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 19:59:29,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 19:59:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 19:59:29,103 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 127 states. [2019-09-03 19:59:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:29,756 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-09-03 19:59:29,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 19:59:29,757 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 258 [2019-09-03 19:59:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:29,758 INFO L225 Difference]: With dead ends: 267 [2019-09-03 19:59:29,758 INFO L226 Difference]: Without dead ends: 262 [2019-09-03 19:59:29,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 19:59:29,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-03 19:59:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-09-03 19:59:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-03 19:59:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-09-03 19:59:29,761 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2019-09-03 19:59:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:29,761 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-09-03 19:59:29,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 19:59:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-09-03 19:59:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 19:59:29,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:29,763 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:29,763 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash 918356993, now seen corresponding path program 125 times [2019-09-03 19:59:29,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:29,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:29,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:29,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:29,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:35,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:35,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:35,137 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:35,320 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2019-09-03 19:59:35,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:35,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-03 19:59:35,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:35,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:35,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2019-09-03 19:59:35,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-03 19:59:35,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-03 19:59:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 19:59:35,379 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 128 states. [2019-09-03 19:59:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:35,954 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2019-09-03 19:59:35,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-03 19:59:35,955 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 260 [2019-09-03 19:59:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:35,955 INFO L225 Difference]: With dead ends: 269 [2019-09-03 19:59:35,955 INFO L226 Difference]: Without dead ends: 264 [2019-09-03 19:59:35,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 19:59:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-03 19:59:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-09-03 19:59:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-03 19:59:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-09-03 19:59:35,959 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2019-09-03 19:59:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:35,959 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2019-09-03 19:59:35,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-03 19:59:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2019-09-03 19:59:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-03 19:59:35,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:35,960 INFO L399 BasicCegarLoop]: trace histogram [126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:35,960 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1086831937, now seen corresponding path program 126 times [2019-09-03 19:59:35,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:35,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:35,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:35,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:35,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:41,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:41,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:41,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:41,646 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2019-09-03 19:59:41,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:41,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 19:59:41,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:41,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:41,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-03 19:59:41,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 19:59:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 19:59:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 19:59:41,706 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 129 states. [2019-09-03 19:59:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:42,494 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-09-03 19:59:42,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 19:59:42,494 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 262 [2019-09-03 19:59:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:42,495 INFO L225 Difference]: With dead ends: 271 [2019-09-03 19:59:42,495 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 19:59:42,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 19:59:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 19:59:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-09-03 19:59:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-03 19:59:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-09-03 19:59:42,500 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2019-09-03 19:59:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:42,500 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-09-03 19:59:42,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 19:59:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-09-03 19:59:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-03 19:59:42,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:42,501 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:42,502 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash 366922237, now seen corresponding path program 127 times [2019-09-03 19:59:42,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:42,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:42,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:48,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:48,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:48,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-03 19:59:48,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:48,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:48,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2019-09-03 19:59:48,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-03 19:59:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-03 19:59:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:59:48,175 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 130 states. [2019-09-03 19:59:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:48,885 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-09-03 19:59:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-03 19:59:48,885 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 264 [2019-09-03 19:59:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:48,886 INFO L225 Difference]: With dead ends: 273 [2019-09-03 19:59:48,887 INFO L226 Difference]: Without dead ends: 268 [2019-09-03 19:59:48,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:59:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-03 19:59:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2019-09-03 19:59:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-03 19:59:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-09-03 19:59:48,890 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2019-09-03 19:59:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:48,890 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-09-03 19:59:48,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-03 19:59:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-09-03 19:59:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-03 19:59:48,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:48,891 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:48,891 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:48,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1560312251, now seen corresponding path program 128 times [2019-09-03 19:59:48,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:48,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:54,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:54,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:54,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:54,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:54,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:54,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 19:59:54,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:54,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:54,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-03 19:59:54,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-03 19:59:54,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-03 19:59:54,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 19:59:54,612 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 131 states. [2019-09-03 19:59:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:55,421 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-09-03 19:59:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 19:59:55,421 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 266 [2019-09-03 19:59:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:55,422 INFO L225 Difference]: With dead ends: 275 [2019-09-03 19:59:55,422 INFO L226 Difference]: Without dead ends: 270 [2019-09-03 19:59:55,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 19:59:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-03 19:59:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-09-03 19:59:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-03 19:59:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-09-03 19:59:55,425 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2019-09-03 19:59:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:55,425 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-09-03 19:59:55,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-03 19:59:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-09-03 19:59:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 19:59:55,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:55,426 INFO L399 BasicCegarLoop]: trace histogram [129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:55,427 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1651847673, now seen corresponding path program 129 times [2019-09-03 19:59:55,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:55,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:55,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:55,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:55,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:01,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:01,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:01,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:01,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2019-09-03 20:00:01,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:01,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-03 20:00:01,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:01,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:01,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2019-09-03 20:00:01,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-03 20:00:01,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-03 20:00:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:00:01,504 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 132 states. [2019-09-03 20:00:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:02,074 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2019-09-03 20:00:02,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-03 20:00:02,074 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 268 [2019-09-03 20:00:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:02,075 INFO L225 Difference]: With dead ends: 277 [2019-09-03 20:00:02,075 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 20:00:02,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:00:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 20:00:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-09-03 20:00:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 20:00:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-09-03 20:00:02,079 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2019-09-03 20:00:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:02,079 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-09-03 20:00:02,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-03 20:00:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-09-03 20:00:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 20:00:02,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:02,080 INFO L399 BasicCegarLoop]: trace histogram [130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:02,080 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash -576925001, now seen corresponding path program 130 times [2019-09-03 20:00:02,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:02,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:02,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:07,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:07,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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:07,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:07,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:07,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:07,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 20:00:07,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:07,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:07,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-03 20:00:07,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 20:00:07,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 20:00:07,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:00:07,974 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 133 states. [2019-09-03 20:00:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:08,497 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-09-03 20:00:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 20:00:08,498 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 270 [2019-09-03 20:00:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:08,499 INFO L225 Difference]: With dead ends: 279 [2019-09-03 20:00:08,499 INFO L226 Difference]: Without dead ends: 274 [2019-09-03 20:00:08,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:00:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-03 20:00:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-09-03 20:00:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-03 20:00:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-09-03 20:00:08,504 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2019-09-03 20:00:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:08,504 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-09-03 20:00:08,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 20:00:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-09-03 20:00:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-03 20:00:08,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:08,505 INFO L399 BasicCegarLoop]: trace histogram [131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:08,505 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash 761215989, now seen corresponding path program 131 times [2019-09-03 20:00:08,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:08,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:08,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:14,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:14,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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:14,602 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2019-09-03 20:00:14,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:14,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-03 20:00:14,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:14,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:14,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2019-09-03 20:00:14,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-03 20:00:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-03 20:00:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:00:14,681 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 134 states. [2019-09-03 20:00:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:15,343 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-09-03 20:00:15,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-03 20:00:15,344 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 272 [2019-09-03 20:00:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:15,345 INFO L225 Difference]: With dead ends: 281 [2019-09-03 20:00:15,345 INFO L226 Difference]: Without dead ends: 276 [2019-09-03 20:00:15,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:00:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-03 20:00:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2019-09-03 20:00:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-03 20:00:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-09-03 20:00:15,349 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2019-09-03 20:00:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:15,350 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2019-09-03 20:00:15,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-03 20:00:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2019-09-03 20:00:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-03 20:00:15,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:15,351 INFO L399 BasicCegarLoop]: trace histogram [132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:15,351 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1775481421, now seen corresponding path program 132 times [2019-09-03 20:00:15,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:15,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:15,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:21,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:21,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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:21,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:00:21,525 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2019-09-03 20:00:21,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:21,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 20:00:21,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:21,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:21,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-03 20:00:21,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 20:00:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 20:00:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:00:21,586 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 135 states. [2019-09-03 20:00:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:22,332 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-09-03 20:00:22,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 20:00:22,332 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 274 [2019-09-03 20:00:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:22,333 INFO L225 Difference]: With dead ends: 283 [2019-09-03 20:00:22,334 INFO L226 Difference]: Without dead ends: 278 [2019-09-03 20:00:22,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:00:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-03 20:00:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-09-03 20:00:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-03 20:00:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-09-03 20:00:22,338 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2019-09-03 20:00:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:22,338 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-09-03 20:00:22,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 20:00:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-09-03 20:00:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 20:00:22,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:22,339 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:22,339 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash -268303, now seen corresponding path program 133 times [2019-09-03 20:00:22,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:22,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:22,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:28,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:28,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:28,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:28,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-03 20:00:28,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:28,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:28,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2019-09-03 20:00:28,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-03 20:00:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-03 20:00:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:00:28,525 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 136 states. [2019-09-03 20:00:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:29,243 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-09-03 20:00:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-03 20:00:29,243 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 276 [2019-09-03 20:00:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:29,244 INFO L225 Difference]: With dead ends: 285 [2019-09-03 20:00:29,245 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 20:00:29,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:00:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 20:00:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2019-09-03 20:00:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 20:00:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2019-09-03 20:00:29,250 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2019-09-03 20:00:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:29,251 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2019-09-03 20:00:29,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-03 20:00:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2019-09-03 20:00:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-03 20:00:29,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:29,252 INFO L399 BasicCegarLoop]: trace histogram [134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:29,253 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash 877521583, now seen corresponding path program 134 times [2019-09-03 20:00:29,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:29,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:29,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:35,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:35,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:35,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:35,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:35,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:35,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 20:00:35,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:35,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:35,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-03 20:00:35,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-03 20:00:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-03 20:00:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 20:00:35,636 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 137 states. [2019-09-03 20:00:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:36,231 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-09-03 20:00:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-03 20:00:36,232 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 278 [2019-09-03 20:00:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:36,233 INFO L225 Difference]: With dead ends: 287 [2019-09-03 20:00:36,233 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 20:00:36,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 20:00:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 20:00:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-09-03 20:00:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-03 20:00:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-09-03 20:00:36,237 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2019-09-03 20:00:36,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:36,238 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-09-03 20:00:36,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-03 20:00:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-09-03 20:00:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-03 20:00:36,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:36,239 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:36,239 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1674955283, now seen corresponding path program 135 times [2019-09-03 20:00:36,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:36,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:36,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:42,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:42,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:42,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:42,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2019-09-03 20:00:42,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:42,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-03 20:00:42,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:42,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:42,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2019-09-03 20:00:42,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-03 20:00:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-03 20:00:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:00:42,762 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 138 states. [2019-09-03 20:00:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:43,314 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2019-09-03 20:00:43,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-03 20:00:43,315 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 280 [2019-09-03 20:00:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:43,315 INFO L225 Difference]: With dead ends: 289 [2019-09-03 20:00:43,315 INFO L226 Difference]: Without dead ends: 284 [2019-09-03 20:00:43,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:00:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-03 20:00:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-09-03 20:00:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-03 20:00:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-09-03 20:00:43,320 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2019-09-03 20:00:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:43,320 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-09-03 20:00:43,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-03 20:00:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-09-03 20:00:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-03 20:00:43,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:43,321 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:43,321 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2116069803, now seen corresponding path program 136 times [2019-09-03 20:00:43,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:43,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:43,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:49,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:49,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:49,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:49,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:49,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:49,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-03 20:00:49,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:49,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-03 20:00:49,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 20:00:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 20:00:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:00:49,753 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 139 states. [2019-09-03 20:00:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:50,587 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-09-03 20:00:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 20:00:50,588 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 282 [2019-09-03 20:00:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:50,589 INFO L225 Difference]: With dead ends: 291 [2019-09-03 20:00:50,589 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 20:00:50,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:00:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 20:00:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-09-03 20:00:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-03 20:00:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-09-03 20:00:50,592 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2019-09-03 20:00:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:50,592 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-09-03 20:00:50,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 20:00:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-09-03 20:00:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 20:00:50,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:50,593 INFO L399 BasicCegarLoop]: trace histogram [137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:50,594 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1136056855, now seen corresponding path program 137 times [2019-09-03 20:00:50,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:50,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:50,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:56,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:56,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:57,009 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:57,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2019-09-03 20:00:57,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:57,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 20:00:57,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:57,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:57,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2019-09-03 20:00:57,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-03 20:00:57,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-03 20:00:57,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:00:57,284 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 140 states. [2019-09-03 20:00:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:58,300 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2019-09-03 20:00:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-03 20:00:58,301 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 284 [2019-09-03 20:00:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:58,302 INFO L225 Difference]: With dead ends: 293 [2019-09-03 20:00:58,302 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 20:00:58,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:00:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 20:00:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2019-09-03 20:00:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 20:00:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-09-03 20:00:58,306 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2019-09-03 20:00:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:58,306 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-09-03 20:00:58,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-03 20:00:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-09-03 20:00:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-03 20:00:58,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:58,308 INFO L399 BasicCegarLoop]: trace histogram [138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:58,308 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 306416295, now seen corresponding path program 138 times [2019-09-03 20:00:58,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:58,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:58,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:58,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:58,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:04,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:04,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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:04,808 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:05,019 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-09-03 20:01:05,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:05,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 20:01:05,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:05,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:05,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-03 20:01:05,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 20:01:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 20:01:05,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:01:05,092 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 141 states. [2019-09-03 20:01:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:06,044 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-09-03 20:01:06,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-03 20:01:06,044 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 286 [2019-09-03 20:01:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:06,045 INFO L225 Difference]: With dead ends: 295 [2019-09-03 20:01:06,045 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 20:01:06,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:01:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 20:01:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-09-03 20:01:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-03 20:01:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-09-03 20:01:06,050 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2019-09-03 20:01:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:06,050 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-09-03 20:01:06,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 20:01:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-09-03 20:01:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-03 20:01:06,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:06,052 INFO L399 BasicCegarLoop]: trace histogram [139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:06,052 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash -751323163, now seen corresponding path program 139 times [2019-09-03 20:01:06,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:06,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:06,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:12,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:12,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:12,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:12,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 20:01:12,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:12,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:12,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2019-09-03 20:01:12,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-03 20:01:12,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-03 20:01:12,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:01:12,802 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 142 states. [2019-09-03 20:01:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:13,389 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-09-03 20:01:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 20:01:13,389 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 288 [2019-09-03 20:01:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:13,390 INFO L225 Difference]: With dead ends: 297 [2019-09-03 20:01:13,390 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 20:01:13,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:01:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 20:01:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-09-03 20:01:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-03 20:01:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-09-03 20:01:13,394 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2019-09-03 20:01:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:13,394 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-09-03 20:01:13,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-03 20:01:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-09-03 20:01:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-03 20:01:13,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:13,395 INFO L399 BasicCegarLoop]: trace histogram [140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:13,395 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:13,395 INFO L82 PathProgramCache]: Analyzing trace with hash 668306851, now seen corresponding path program 140 times [2019-09-03 20:01:13,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:13,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:13,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:13,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:13,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:20,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:20,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:20,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:20,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:20,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:20,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-03 20:01:20,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:20,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:20,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-03 20:01:20,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-03 20:01:20,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-03 20:01:20,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:01:20,276 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 143 states. [2019-09-03 20:01:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:21,368 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-09-03 20:01:21,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 20:01:21,368 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 290 [2019-09-03 20:01:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:21,369 INFO L225 Difference]: With dead ends: 299 [2019-09-03 20:01:21,369 INFO L226 Difference]: Without dead ends: 294 [2019-09-03 20:01:21,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:01:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-03 20:01:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-09-03 20:01:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-03 20:01:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-09-03 20:01:21,373 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2019-09-03 20:01:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:21,373 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-09-03 20:01:21,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-03 20:01:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-09-03 20:01:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 20:01:21,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:21,374 INFO L399 BasicCegarLoop]: trace histogram [141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:21,375 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -866849823, now seen corresponding path program 141 times [2019-09-03 20:01:21,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:21,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:28,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:28,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:28,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:28,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2019-09-03 20:01:28,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:28,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 20:01:28,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:28,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:28,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2019-09-03 20:01:28,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-03 20:01:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-03 20:01:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:01:28,610 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 144 states. [2019-09-03 20:01:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:29,516 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-09-03 20:01:29,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-03 20:01:29,516 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 292 [2019-09-03 20:01:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:29,517 INFO L225 Difference]: With dead ends: 301 [2019-09-03 20:01:29,518 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:01:29,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:01:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:01:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-09-03 20:01:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 20:01:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-09-03 20:01:29,522 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2019-09-03 20:01:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:29,522 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-09-03 20:01:29,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-03 20:01:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-09-03 20:01:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-03 20:01:29,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:29,523 INFO L399 BasicCegarLoop]: trace histogram [142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:29,524 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1316336287, now seen corresponding path program 142 times [2019-09-03 20:01:29,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:29,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:36,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:36,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:36,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:01:36,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:36,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:36,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-03 20:01:36,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:36,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:36,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-03 20:01:36,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 20:01:36,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 20:01:36,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 20:01:36,573 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 145 states. [2019-09-03 20:01:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:37,669 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-09-03 20:01:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-03 20:01:37,670 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 294 [2019-09-03 20:01:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:37,671 INFO L225 Difference]: With dead ends: 303 [2019-09-03 20:01:37,671 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 20:01:37,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 20:01:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 20:01:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-09-03 20:01:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-03 20:01:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-09-03 20:01:37,674 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2019-09-03 20:01:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:37,674 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-09-03 20:01:37,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 20:01:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-09-03 20:01:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-03 20:01:37,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:37,675 INFO L399 BasicCegarLoop]: trace histogram [143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:37,676 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash -880819747, now seen corresponding path program 143 times [2019-09-03 20:01:37,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:37,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:37,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:37,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:37,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:44,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:44,768 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:01:44,974 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2019-09-03 20:01:44,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:44,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-03 20:01:44,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:45,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:45,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2019-09-03 20:01:45,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-03 20:01:45,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-03 20:01:45,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:01:45,045 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 146 states. [2019-09-03 20:01:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:45,921 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-09-03 20:01:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-03 20:01:45,922 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 296 [2019-09-03 20:01:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:45,923 INFO L225 Difference]: With dead ends: 305 [2019-09-03 20:01:45,923 INFO L226 Difference]: Without dead ends: 300 [2019-09-03 20:01:45,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:01:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-03 20:01:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-09-03 20:01:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-03 20:01:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-09-03 20:01:45,927 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2019-09-03 20:01:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:45,928 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2019-09-03 20:01:45,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-03 20:01:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2019-09-03 20:01:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-03 20:01:45,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:45,929 INFO L399 BasicCegarLoop]: trace histogram [144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:45,929 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash 776141211, now seen corresponding path program 144 times [2019-09-03 20:01:45,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:45,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:45,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:53,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:53,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:53,133 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:53,362 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2019-09-03 20:01:53,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:53,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-03 20:01:53,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:53,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:53,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-03 20:01:53,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-03 20:01:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-03 20:01:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:01:53,436 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 147 states. [2019-09-03 20:01:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:54,640 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-09-03 20:01:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-03 20:01:54,641 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 298 [2019-09-03 20:01:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:54,642 INFO L225 Difference]: With dead ends: 307 [2019-09-03 20:01:54,642 INFO L226 Difference]: Without dead ends: 302 [2019-09-03 20:01:54,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:01:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-03 20:01:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-09-03 20:01:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-03 20:01:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-09-03 20:01:54,647 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2019-09-03 20:01:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:54,648 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-09-03 20:01:54,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-03 20:01:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-09-03 20:01:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 20:01:54,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:54,649 INFO L399 BasicCegarLoop]: trace histogram [145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:54,649 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash -317244967, now seen corresponding path program 145 times [2019-09-03 20:01:54,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:54,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:54,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:54,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:01,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:01,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 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:01,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:02,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-03 20:02:02,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:02,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:02,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2019-09-03 20:02:02,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-03 20:02:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-03 20:02:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:02:02,079 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 148 states. [2019-09-03 20:02:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:02,693 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2019-09-03 20:02:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-03 20:02:02,693 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 300 [2019-09-03 20:02:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:02,694 INFO L225 Difference]: With dead ends: 309 [2019-09-03 20:02:02,694 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 20:02:02,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:02:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 20:02:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2019-09-03 20:02:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 20:02:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-09-03 20:02:02,699 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2019-09-03 20:02:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:02,699 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2019-09-03 20:02:02,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-03 20:02:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2019-09-03 20:02:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-03 20:02:02,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:02,700 INFO L399 BasicCegarLoop]: trace histogram [146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:02,700 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1205625495, now seen corresponding path program 146 times [2019-09-03 20:02:02,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:02,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:02,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:02,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:10,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:10,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:10,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:10,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:10,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:10,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-03 20:02:10,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:10,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:10,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-03 20:02:10,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-03 20:02:10,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-03 20:02:10,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 20:02:10,160 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 149 states. [2019-09-03 20:02:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:11,249 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-09-03 20:02:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-03 20:02:11,249 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 302 [2019-09-03 20:02:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:11,250 INFO L225 Difference]: With dead ends: 311 [2019-09-03 20:02:11,250 INFO L226 Difference]: Without dead ends: 306 [2019-09-03 20:02:11,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 20:02:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-03 20:02:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-09-03 20:02:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-03 20:02:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-09-03 20:02:11,254 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2019-09-03 20:02:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:11,254 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-09-03 20:02:11,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-03 20:02:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-09-03 20:02:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-03 20:02:11,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:11,256 INFO L399 BasicCegarLoop]: trace histogram [147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:11,256 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash 100291541, now seen corresponding path program 147 times [2019-09-03 20:02:11,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:11,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:11,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:18,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:18,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:18,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:18,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2019-09-03 20:02:18,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:18,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 20:02:18,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:18,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:18,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2019-09-03 20:02:18,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-03 20:02:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-03 20:02:18,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 20:02:18,992 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 150 states. [2019-09-03 20:02:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:20,226 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2019-09-03 20:02:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-03 20:02:20,226 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 304 [2019-09-03 20:02:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:20,227 INFO L225 Difference]: With dead ends: 313 [2019-09-03 20:02:20,227 INFO L226 Difference]: Without dead ends: 308 [2019-09-03 20:02:20,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 20:02:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-03 20:02:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2019-09-03 20:02:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-03 20:02:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-09-03 20:02:20,231 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2019-09-03 20:02:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:20,231 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-09-03 20:02:20,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-03 20:02:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-09-03 20:02:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-03 20:02:20,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:20,232 INFO L399 BasicCegarLoop]: trace histogram [148, 148, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:20,232 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1268716141, now seen corresponding path program 148 times [2019-09-03 20:02:20,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:20,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:20,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:20,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:20,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:27,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:27,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:27,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:27,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:27,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:27,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-03 20:02:27,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:28,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:28,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-03 20:02:28,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-03 20:02:28,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-03 20:02:28,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 20:02:28,043 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 151 states. [2019-09-03 20:02:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:29,051 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-09-03 20:02:29,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-03 20:02:29,051 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 306 [2019-09-03 20:02:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:29,052 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:02:29,052 INFO L226 Difference]: Without dead ends: 310 [2019-09-03 20:02:29,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 20:02:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-03 20:02:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-09-03 20:02:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-03 20:02:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-09-03 20:02:29,056 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2019-09-03 20:02:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:29,056 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-09-03 20:02:29,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-03 20:02:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-09-03 20:02:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-03 20:02:29,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:29,057 INFO L399 BasicCegarLoop]: trace histogram [149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:29,057 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1669861329, now seen corresponding path program 149 times [2019-09-03 20:02:29,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:29,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:29,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:36,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:36,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:36,607 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:02:36,849 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 150 check-sat command(s) [2019-09-03 20:02:36,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:36,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-03 20:02:36,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:36,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:36,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2019-09-03 20:02:36,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-03 20:02:36,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-03 20:02:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 20:02:36,924 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 152 states. [2019-09-03 20:02:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:37,591 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2019-09-03 20:02:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-03 20:02:37,591 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 308 [2019-09-03 20:02:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:37,592 INFO L225 Difference]: With dead ends: 317 [2019-09-03 20:02:37,592 INFO L226 Difference]: Without dead ends: 312 [2019-09-03 20:02:37,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 20:02:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-03 20:02:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 311. [2019-09-03 20:02:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-03 20:02:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-09-03 20:02:37,598 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2019-09-03 20:02:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:37,599 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-09-03 20:02:37,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-03 20:02:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-09-03 20:02:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-03 20:02:37,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:37,600 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:37,600 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:37,601 INFO L82 PathProgramCache]: Analyzing trace with hash -445670769, now seen corresponding path program 150 times [2019-09-03 20:02:37,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:37,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:37,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:45,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:45,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:45,361 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:02:45,605 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2019-09-03 20:02:45,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:45,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-03 20:02:45,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2019-09-03 20:02:45,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 20:02:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 20:02:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:02:45,679 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 153 states. [2019-09-03 20:02:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:46,410 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-09-03 20:02:46,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-03 20:02:46,411 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 310 [2019-09-03 20:02:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:46,412 INFO L225 Difference]: With dead ends: 319 [2019-09-03 20:02:46,412 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 20:02:46,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:02:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 20:02:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-09-03 20:02:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-03 20:02:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-09-03 20:02:46,417 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2019-09-03 20:02:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:46,417 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-09-03 20:02:46,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 20:02:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-09-03 20:02:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-03 20:02:46,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:46,419 INFO L399 BasicCegarLoop]: trace histogram [151, 151, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:46,419 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1952485939, now seen corresponding path program 151 times [2019-09-03 20:02:46,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:46,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:46,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:54,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:54,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:54,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 20:02:54,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:54,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:54,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 154 [2019-09-03 20:02:54,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-03 20:02:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-03 20:02:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:02:54,343 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 154 states. [2019-09-03 20:02:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:55,284 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-09-03 20:02:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-03 20:02:55,285 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 312 [2019-09-03 20:02:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:55,286 INFO L225 Difference]: With dead ends: 321 [2019-09-03 20:02:55,286 INFO L226 Difference]: Without dead ends: 316 [2019-09-03 20:02:55,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:02:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-03 20:02:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2019-09-03 20:02:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-03 20:02:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2019-09-03 20:02:55,291 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2019-09-03 20:02:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:55,291 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2019-09-03 20:02:55,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-03 20:02:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2019-09-03 20:02:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-03 20:02:55,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:55,292 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:55,292 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1697081739, now seen corresponding path program 152 times [2019-09-03 20:02:55,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:55,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:55,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:03,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:03,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:03,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:03:03,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:03,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:03,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-03 20:03:03,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:03,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:03,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2019-09-03 20:03:03,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-03 20:03:03,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-03 20:03:03,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 20:03:03,312 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 155 states. [2019-09-03 20:03:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:04,305 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-09-03 20:03:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-03 20:03:04,306 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 314 [2019-09-03 20:03:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:04,307 INFO L225 Difference]: With dead ends: 323 [2019-09-03 20:03:04,307 INFO L226 Difference]: Without dead ends: 318 [2019-09-03 20:03:04,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 20:03:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-03 20:03:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-09-03 20:03:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-03 20:03:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-09-03 20:03:04,313 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2019-09-03 20:03:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:04,313 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-09-03 20:03:04,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-03 20:03:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-09-03 20:03:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 20:03:04,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:04,315 INFO L399 BasicCegarLoop]: trace histogram [153, 153, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:04,315 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:04,316 INFO L82 PathProgramCache]: Analyzing trace with hash -56660535, now seen corresponding path program 153 times [2019-09-03 20:03:04,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:04,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:04,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:12,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:12,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 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:12,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:03:12,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 154 check-sat command(s) [2019-09-03 20:03:12,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:12,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-03 20:03:12,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:12,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 156 [2019-09-03 20:03:12,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-03 20:03:12,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-03 20:03:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:03:12,697 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 156 states. [2019-09-03 20:03:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:13,604 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-09-03 20:03:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-03 20:03:13,604 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 316 [2019-09-03 20:03:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:13,605 INFO L225 Difference]: With dead ends: 325 [2019-09-03 20:03:13,605 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 20:03:13,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:03:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 20:03:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-09-03 20:03:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-03 20:03:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2019-09-03 20:03:13,610 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2019-09-03 20:03:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:13,610 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2019-09-03 20:03:13,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-03 20:03:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2019-09-03 20:03:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 20:03:13,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:13,611 INFO L399 BasicCegarLoop]: trace histogram [154, 154, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:13,611 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1775805817, now seen corresponding path program 154 times [2019-09-03 20:03:13,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:13,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:13,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:21,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:21,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:03:21,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:21,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:21,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-03 20:03:21,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:21,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:21,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2019-09-03 20:03:21,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 20:03:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 20:03:21,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 20:03:21,776 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 157 states. [2019-09-03 20:03:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:22,507 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-09-03 20:03:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-03 20:03:22,508 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 318 [2019-09-03 20:03:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:22,509 INFO L225 Difference]: With dead ends: 327 [2019-09-03 20:03:22,509 INFO L226 Difference]: Without dead ends: 322 [2019-09-03 20:03:22,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 20:03:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-03 20:03:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-09-03 20:03:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-03 20:03:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-09-03 20:03:22,515 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2019-09-03 20:03:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:22,515 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-09-03 20:03:22,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 20:03:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-09-03 20:03:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-03 20:03:22,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:22,517 INFO L399 BasicCegarLoop]: trace histogram [155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:22,517 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:22,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash -312012859, now seen corresponding path program 155 times [2019-09-03 20:03:22,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:22,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:22,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:22,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:30,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:30,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:30,795 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:03:31,045 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2019-09-03 20:03:31,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:31,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-03 20:03:31,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:31,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:31,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 158 [2019-09-03 20:03:31,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-09-03 20:03:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-09-03 20:03:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:03:31,123 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 158 states. [2019-09-03 20:03:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:31,924 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2019-09-03 20:03:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-03 20:03:31,924 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 320 [2019-09-03 20:03:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:31,925 INFO L225 Difference]: With dead ends: 329 [2019-09-03 20:03:31,925 INFO L226 Difference]: Without dead ends: 324 [2019-09-03 20:03:31,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:03:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-03 20:03:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2019-09-03 20:03:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-03 20:03:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2019-09-03 20:03:31,929 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2019-09-03 20:03:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:31,929 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2019-09-03 20:03:31,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-09-03 20:03:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2019-09-03 20:03:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-03 20:03:31,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:31,930 INFO L399 BasicCegarLoop]: trace histogram [156, 156, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:31,930 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:31,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1938713987, now seen corresponding path program 156 times [2019-09-03 20:03:31,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:31,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:31,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:40,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:40,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:03:40,487 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 157 check-sat command(s) [2019-09-03 20:03:40,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:40,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-03 20:03:40,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:40,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:40,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2019-09-03 20:03:40,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-03 20:03:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-03 20:03:40,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 20:03:40,568 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 159 states. [2019-09-03 20:03:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:41,866 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-09-03 20:03:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-03 20:03:41,866 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 322 [2019-09-03 20:03:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:41,867 INFO L225 Difference]: With dead ends: 331 [2019-09-03 20:03:41,867 INFO L226 Difference]: Without dead ends: 326 [2019-09-03 20:03:41,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 20:03:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-03 20:03:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-09-03 20:03:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-03 20:03:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-09-03 20:03:41,870 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2019-09-03 20:03:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:41,870 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-09-03 20:03:41,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-03 20:03:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-09-03 20:03:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 20:03:41,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:41,872 INFO L399 BasicCegarLoop]: trace histogram [157, 157, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:41,872 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:41,872 INFO L82 PathProgramCache]: Analyzing trace with hash 223695809, now seen corresponding path program 157 times [2019-09-03 20:03:41,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:41,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:41,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:41,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:50,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:50,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:50,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:50,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-03 20:03:50,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:50,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:50,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160, 160] total 160 [2019-09-03 20:03:50,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-03 20:03:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-03 20:03:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:03:50,564 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 160 states. [2019-09-03 20:03:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:52,098 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2019-09-03 20:03:52,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-03 20:03:52,098 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 324 [2019-09-03 20:03:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:52,099 INFO L225 Difference]: With dead ends: 333 [2019-09-03 20:03:52,099 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 20:03:52,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:03:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 20:03:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2019-09-03 20:03:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-03 20:03:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-09-03 20:03:52,103 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2019-09-03 20:03:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:52,103 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-09-03 20:03:52,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-03 20:03:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-09-03 20:03:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-03 20:03:52,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:52,104 INFO L399 BasicCegarLoop]: trace histogram [158, 158, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:52,104 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1358668415, now seen corresponding path program 158 times [2019-09-03 20:03:52,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:52,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:52,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:52,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:00,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:00,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 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:00,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:00,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:00,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:00,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-03 20:04:00,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:00,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:00,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2019-09-03 20:04:00,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-03 20:04:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-03 20:04:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 20:04:00,773 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 161 states. [2019-09-03 20:04:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:01,986 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-09-03 20:04:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-03 20:04:01,987 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 326 [2019-09-03 20:04:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:01,988 INFO L225 Difference]: With dead ends: 335 [2019-09-03 20:04:01,988 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 20:04:01,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 20:04:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 20:04:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-09-03 20:04:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-03 20:04:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-09-03 20:04:01,993 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2019-09-03 20:04:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:01,993 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-09-03 20:04:01,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-03 20:04:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-09-03 20:04:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-03 20:04:01,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:01,995 INFO L399 BasicCegarLoop]: trace histogram [159, 159, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:01,995 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1145649597, now seen corresponding path program 159 times [2019-09-03 20:04:01,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:01,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:01,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:10,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:10,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:10,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 160 check-sat command(s) [2019-09-03 20:04:10,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:10,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-03 20:04:10,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:10,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:10,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162, 162] total 162 [2019-09-03 20:04:10,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-03 20:04:10,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-03 20:04:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 20:04:10,969 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 162 states. [2019-09-03 20:04:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:11,887 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2019-09-03 20:04:11,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-09-03 20:04:11,887 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 328 [2019-09-03 20:04:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:11,888 INFO L225 Difference]: With dead ends: 337 [2019-09-03 20:04:11,888 INFO L226 Difference]: Without dead ends: 332 [2019-09-03 20:04:11,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 20:04:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-03 20:04:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2019-09-03 20:04:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-03 20:04:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-09-03 20:04:11,892 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2019-09-03 20:04:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:11,892 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-09-03 20:04:11,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-03 20:04:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-09-03 20:04:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-03 20:04:11,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:11,893 INFO L399 BasicCegarLoop]: trace histogram [160, 160, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:11,893 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1701971589, now seen corresponding path program 160 times [2019-09-03 20:04:11,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:11,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:11,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:11,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:11,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:20,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:20,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:20,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:20,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:20,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:20,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-03 20:04:20,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:20,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2019-09-03 20:04:20,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-03 20:04:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-03 20:04:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:04:20,899 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 163 states. [2019-09-03 20:04:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:22,483 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-09-03 20:04:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-03 20:04:22,483 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 330 [2019-09-03 20:04:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:22,484 INFO L225 Difference]: With dead ends: 339 [2019-09-03 20:04:22,484 INFO L226 Difference]: Without dead ends: 334 [2019-09-03 20:04:22,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:04:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-03 20:04:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-09-03 20:04:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-03 20:04:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-09-03 20:04:22,489 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2019-09-03 20:04:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:22,490 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-09-03 20:04:22,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-03 20:04:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-09-03 20:04:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-03 20:04:22,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:22,491 INFO L399 BasicCegarLoop]: trace histogram [161, 161, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:22,491 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1923203513, now seen corresponding path program 161 times [2019-09-03 20:04:22,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:22,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:22,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:22,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:31,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:31,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:31,384 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:04:31,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 162 check-sat command(s) [2019-09-03 20:04:31,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:31,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-03 20:04:31,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:31,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:31,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164, 164] total 164 [2019-09-03 20:04:31,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-09-03 20:04:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-09-03 20:04:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 20:04:31,738 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 164 states. [2019-09-03 20:04:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:32,476 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-09-03 20:04:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-03 20:04:32,476 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 332 [2019-09-03 20:04:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:32,477 INFO L225 Difference]: With dead ends: 341 [2019-09-03 20:04:32,477 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 20:04:32,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 20:04:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 20:04:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-09-03 20:04:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-03 20:04:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2019-09-03 20:04:32,482 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2019-09-03 20:04:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:32,482 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2019-09-03 20:04:32,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-09-03 20:04:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2019-09-03 20:04:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-03 20:04:32,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:32,483 INFO L399 BasicCegarLoop]: trace histogram [162, 162, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:32,483 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1796967817, now seen corresponding path program 162 times [2019-09-03 20:04:32,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:32,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:41,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:41,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:41,301 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:04:41,568 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 163 check-sat command(s) [2019-09-03 20:04:41,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:41,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-03 20:04:41,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:41,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:41,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 165 [2019-09-03 20:04:41,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 20:04:41,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 20:04:41,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:04:41,653 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 165 states. [2019-09-03 20:04:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:43,341 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-09-03 20:04:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-03 20:04:43,341 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 334 [2019-09-03 20:04:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:43,342 INFO L225 Difference]: With dead ends: 343 [2019-09-03 20:04:43,342 INFO L226 Difference]: Without dead ends: 338 [2019-09-03 20:04:43,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:04:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-03 20:04:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-09-03 20:04:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-03 20:04:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-09-03 20:04:43,346 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2019-09-03 20:04:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:43,346 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-09-03 20:04:43,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 20:04:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-09-03 20:04:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-03 20:04:43,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:43,348 INFO L399 BasicCegarLoop]: trace histogram [163, 163, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:43,348 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash 826141621, now seen corresponding path program 163 times [2019-09-03 20:04:43,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:43,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:43,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:43,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:52,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:52,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:52,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:52,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-03 20:04:52,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166, 166] total 166 [2019-09-03 20:04:52,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-03 20:04:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-03 20:04:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 20:04:52,579 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 166 states. [2019-09-03 20:04:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:53,340 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-09-03 20:04:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-03 20:04:53,341 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 336 [2019-09-03 20:04:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:53,341 INFO L225 Difference]: With dead ends: 345 [2019-09-03 20:04:53,341 INFO L226 Difference]: Without dead ends: 340 [2019-09-03 20:04:53,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 20:04:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-03 20:04:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-09-03 20:04:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-03 20:04:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2019-09-03 20:04:53,346 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2019-09-03 20:04:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:53,347 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2019-09-03 20:04:53,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-03 20:04:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2019-09-03 20:04:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-03 20:04:53,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:53,348 INFO L399 BasicCegarLoop]: trace histogram [164, 164, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:53,348 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash 488508787, now seen corresponding path program 164 times [2019-09-03 20:04:53,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:53,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:53,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:53,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:53,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:02,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:02,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:02,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:05:02,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:05:02,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:02,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-03 20:05:02,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:02,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:02,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 167 [2019-09-03 20:05:02,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-03 20:05:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-03 20:05:02,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 20:05:02,592 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 167 states. [2019-09-03 20:05:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:04,111 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-09-03 20:05:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-03 20:05:04,112 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 338 [2019-09-03 20:05:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:04,112 INFO L225 Difference]: With dead ends: 347 [2019-09-03 20:05:04,113 INFO L226 Difference]: Without dead ends: 342 [2019-09-03 20:05:04,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 20:05:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-03 20:05:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-09-03 20:05:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-03 20:05:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-09-03 20:05:04,116 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2019-09-03 20:05:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:04,117 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-09-03 20:05:04,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-03 20:05:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-09-03 20:05:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 20:05:04,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:04,118 INFO L399 BasicCegarLoop]: trace histogram [165, 165, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:04,118 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1854097487, now seen corresponding path program 165 times [2019-09-03 20:05:04,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:04,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:13,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:13,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:13,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:05:13,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 166 check-sat command(s) [2019-09-03 20:05:13,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:13,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-03 20:05:13,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:13,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:13,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168, 168] total 168 [2019-09-03 20:05:13,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-03 20:05:13,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-03 20:05:13,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:05:13,685 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 168 states. [2019-09-03 20:05:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:14,990 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2019-09-03 20:05:14,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-03 20:05:14,991 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 340 [2019-09-03 20:05:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:14,991 INFO L225 Difference]: With dead ends: 349 [2019-09-03 20:05:14,992 INFO L226 Difference]: Without dead ends: 344 [2019-09-03 20:05:14,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:05:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-03 20:05:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2019-09-03 20:05:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-03 20:05:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2019-09-03 20:05:14,995 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2019-09-03 20:05:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:14,995 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2019-09-03 20:05:14,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-03 20:05:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2019-09-03 20:05:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-03 20:05:14,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:14,997 INFO L399 BasicCegarLoop]: trace histogram [166, 166, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:14,997 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1759103599, now seen corresponding path program 166 times [2019-09-03 20:05:14,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:14,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:14,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:14,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:14,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:24,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:24,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:24,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:05:24,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:05:24,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:24,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-03 20:05:24,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:24,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:24,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 169 [2019-09-03 20:05:24,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-03 20:05:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-03 20:05:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:05:24,448 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 169 states. [2019-09-03 20:05:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:25,216 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-09-03 20:05:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-03 20:05:25,217 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 342 [2019-09-03 20:05:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:25,217 INFO L225 Difference]: With dead ends: 351 [2019-09-03 20:05:25,217 INFO L226 Difference]: Without dead ends: 346 [2019-09-03 20:05:25,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:05:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-03 20:05:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-09-03 20:05:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-03 20:05:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-09-03 20:05:25,222 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2019-09-03 20:05:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:25,222 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-09-03 20:05:25,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-03 20:05:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-09-03 20:05:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-03 20:05:25,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:25,223 INFO L399 BasicCegarLoop]: trace histogram [167, 167, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:25,223 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash -583195219, now seen corresponding path program 167 times [2019-09-03 20:05:25,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:25,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:25,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:34,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:34,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:34,766 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:05:35,047 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 168 check-sat command(s) [2019-09-03 20:05:35,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:35,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-03 20:05:35,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170, 170] total 170 [2019-09-03 20:05:35,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-09-03 20:05:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-09-03 20:05:35,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 20:05:35,134 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 170 states. [2019-09-03 20:05:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:36,822 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2019-09-03 20:05:36,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-03 20:05:36,822 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 344 [2019-09-03 20:05:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:36,823 INFO L225 Difference]: With dead ends: 353 [2019-09-03 20:05:36,823 INFO L226 Difference]: Without dead ends: 348 [2019-09-03 20:05:36,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 20:05:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-03 20:05:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-09-03 20:05:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-03 20:05:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-09-03 20:05:36,826 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2019-09-03 20:05:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:36,826 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-09-03 20:05:36,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-09-03 20:05:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-09-03 20:05:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-03 20:05:36,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:36,828 INFO L399 BasicCegarLoop]: trace histogram [168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:36,828 INFO L418 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash -969496213, now seen corresponding path program 168 times [2019-09-03 20:05:36,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:36,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:46,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:46,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:46,369 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:05:46,652 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 169 check-sat command(s) [2019-09-03 20:05:46,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:46,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-03 20:05:46,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:46,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:46,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 171 [2019-09-03 20:05:46,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-03 20:05:46,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-03 20:05:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 20:05:46,758 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 171 states. [2019-09-03 20:05:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:48,478 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-09-03 20:05:48,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-03 20:05:48,478 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 346 [2019-09-03 20:05:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:48,479 INFO L225 Difference]: With dead ends: 355 [2019-09-03 20:05:48,479 INFO L226 Difference]: Without dead ends: 350 [2019-09-03 20:05:48,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 20:05:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-03 20:05:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-09-03 20:05:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-03 20:05:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-09-03 20:05:48,483 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2019-09-03 20:05:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:48,483 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-09-03 20:05:48,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-03 20:05:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-09-03 20:05:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 20:05:48,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:48,484 INFO L399 BasicCegarLoop]: trace histogram [169, 169, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:48,484 INFO L418 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1457403305, now seen corresponding path program 169 times [2019-09-03 20:05:48,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:48,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:48,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:58,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:58,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:58,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-03 20:05:58,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:58,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:58,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172, 172] total 172 [2019-09-03 20:05:58,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-03 20:05:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-03 20:05:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:05:58,328 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 172 states. [2019-09-03 20:06:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:00,122 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2019-09-03 20:06:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-03 20:06:00,122 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 348 [2019-09-03 20:06:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:00,123 INFO L225 Difference]: With dead ends: 357 [2019-09-03 20:06:00,123 INFO L226 Difference]: Without dead ends: 352 [2019-09-03 20:06:00,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:06:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-03 20:06:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-09-03 20:06:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-03 20:06:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-09-03 20:06:00,128 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2019-09-03 20:06:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:00,128 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-09-03 20:06:00,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-03 20:06:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-09-03 20:06:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-03 20:06:00,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:00,130 INFO L399 BasicCegarLoop]: trace histogram [170, 170, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:00,130 INFO L418 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1540598375, now seen corresponding path program 170 times [2019-09-03 20:06:00,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:00,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:00,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:06:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:09,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:09,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:06:09,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:06:09,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:09,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 172 conjunts are in the unsatisfiable core [2019-09-03 20:06:09,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:10,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:10,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173, 173] total 173 [2019-09-03 20:06:10,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 173 states [2019-09-03 20:06:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2019-09-03 20:06:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 20:06:10,036 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 173 states. [2019-09-03 20:06:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:11,323 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-09-03 20:06:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-03 20:06:11,323 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 350 [2019-09-03 20:06:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:11,324 INFO L225 Difference]: With dead ends: 359 [2019-09-03 20:06:11,324 INFO L226 Difference]: Without dead ends: 354 [2019-09-03 20:06:11,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 20:06:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-03 20:06:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-09-03 20:06:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-03 20:06:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-09-03 20:06:11,328 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2019-09-03 20:06:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:11,328 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-09-03 20:06:11,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 173 states. [2019-09-03 20:06:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-09-03 20:06:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-03 20:06:11,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:11,329 INFO L399 BasicCegarLoop]: trace histogram [171, 171, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:11,330 INFO L418 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:11,330 INFO L82 PathProgramCache]: Analyzing trace with hash -113317979, now seen corresponding path program 171 times [2019-09-03 20:06:11,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:11,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:11,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:11,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:11,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:21,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:21,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:06:21,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 172 check-sat command(s) [2019-09-03 20:06:21,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:21,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-03 20:06:21,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:21,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:21,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174, 174] total 174 [2019-09-03 20:06:21,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-03 20:06:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-03 20:06:21,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 20:06:21,518 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 174 states. [2019-09-03 20:06:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:22,625 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-09-03 20:06:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-09-03 20:06:22,626 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 352 [2019-09-03 20:06:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:22,626 INFO L225 Difference]: With dead ends: 361 [2019-09-03 20:06:22,626 INFO L226 Difference]: Without dead ends: 356 [2019-09-03 20:06:22,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 20:06:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-03 20:06:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2019-09-03 20:06:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-03 20:06:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2019-09-03 20:06:22,631 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2019-09-03 20:06:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:22,631 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2019-09-03 20:06:22,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-03 20:06:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2019-09-03 20:06:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-03 20:06:22,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:22,632 INFO L399 BasicCegarLoop]: trace histogram [172, 172, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:22,633 INFO L418 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash -389034653, now seen corresponding path program 172 times [2019-09-03 20:06:22,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:22,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:22,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 29584 backedges. 0 proven. 29584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:32,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:32,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:32,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:06:32,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:06:32,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:32,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 174 conjunts are in the unsatisfiable core [2019-09-03 20:06:32,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 29584 backedges. 0 proven. 29584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:32,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:32,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175, 175] total 175 [2019-09-03 20:06:32,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-03 20:06:32,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-03 20:06:32,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 20:06:32,838 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 175 states. [2019-09-03 20:06:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:34,015 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-09-03 20:06:34,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-03 20:06:34,015 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 354 [2019-09-03 20:06:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:34,016 INFO L225 Difference]: With dead ends: 363 [2019-09-03 20:06:34,016 INFO L226 Difference]: Without dead ends: 358 [2019-09-03 20:06:34,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 20:06:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-03 20:06:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-09-03 20:06:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-03 20:06:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-09-03 20:06:34,020 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2019-09-03 20:06:34,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:34,020 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-09-03 20:06:34,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-03 20:06:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-09-03 20:06:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-03 20:06:34,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:34,021 INFO L399 BasicCegarLoop]: trace histogram [173, 173, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:34,021 INFO L418 AbstractCegarLoop]: === Iteration 175 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:34,021 INFO L82 PathProgramCache]: Analyzing trace with hash 935213985, now seen corresponding path program 173 times [2019-09-03 20:06:34,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:34,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29929 backedges. 0 proven. 29929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:44,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:44,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:44,216 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:06:44,510 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 174 check-sat command(s) [2019-09-03 20:06:44,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:44,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-03 20:06:44,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 29929 backedges. 0 proven. 29929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:44,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:44,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176, 176] total 176 [2019-09-03 20:06:44,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-09-03 20:06:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-09-03 20:06:44,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:06:44,604 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 176 states. [2019-09-03 20:06:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:45,954 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-09-03 20:06:45,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-03 20:06:45,955 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 356 [2019-09-03 20:06:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:45,955 INFO L225 Difference]: With dead ends: 365 [2019-09-03 20:06:45,955 INFO L226 Difference]: Without dead ends: 360 [2019-09-03 20:06:45,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:06:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-03 20:06:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2019-09-03 20:06:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-03 20:06:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2019-09-03 20:06:45,959 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2019-09-03 20:06:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:45,959 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2019-09-03 20:06:45,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-09-03 20:06:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2019-09-03 20:06:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-03 20:06:45,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:45,960 INFO L399 BasicCegarLoop]: trace histogram [174, 174, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:45,961 INFO L418 AbstractCegarLoop]: === Iteration 176 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2067131809, now seen corresponding path program 174 times [2019-09-03 20:06:45,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:45,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30276 backedges. 0 proven. 30276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:56,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:56,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:56,219 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:06:56,522 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 175 check-sat command(s) [2019-09-03 20:06:56,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:56,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 176 conjunts are in the unsatisfiable core [2019-09-03 20:06:56,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30276 backedges. 0 proven. 30276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:56,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:56,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177, 177] total 177 [2019-09-03 20:06:56,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-03 20:06:56,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-03 20:06:56,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 20:06:56,617 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 177 states. [2019-09-03 20:06:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:58,309 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-09-03 20:06:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-09-03 20:06:58,310 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 358 [2019-09-03 20:06:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:58,310 INFO L225 Difference]: With dead ends: 367 [2019-09-03 20:06:58,310 INFO L226 Difference]: Without dead ends: 362 [2019-09-03 20:06:58,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 20:06:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-03 20:06:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-09-03 20:06:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-03 20:06:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-09-03 20:06:58,314 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2019-09-03 20:06:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:58,314 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-09-03 20:06:58,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-03 20:06:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-09-03 20:06:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-03 20:06:58,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:58,315 INFO L399 BasicCegarLoop]: trace histogram [175, 175, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:58,316 INFO L418 AbstractCegarLoop]: === Iteration 177 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1103416931, now seen corresponding path program 175 times [2019-09-03 20:06:58,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:58,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:58,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat