java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/down.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:55:54,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:55:54,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:55:54,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:55:54,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:55:54,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:55:54,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:55:54,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:55:54,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:55:54,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:55:54,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:55:54,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:55:54,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:55:54,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:55:54,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:55:54,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:55:54,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:55:54,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:55:54,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:55:54,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:55:54,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:55:54,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:55:54,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:55:54,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:55:54,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:55:54,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:55:54,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:55:54,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:55:54,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:55:54,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:55:54,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:55:54,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:55:54,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:55:54,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:55:54,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:55:54,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:55:54,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:55:54,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:55:54,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:55:54,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:55:54,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:55:54,112 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-08 02:55:54,129 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:55:54,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:55:54,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:55:54,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:55:54,131 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:55:54,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:55:54,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:55:54,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:55:54,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:55:54,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:55:54,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:55:54,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:55:54,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:55:54,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:55:54,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:55:54,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:55:54,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:55:54,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:55:54,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:55:54,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:55:54,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:55:54,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:55:54,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:55:54,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:55:54,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:55:54,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:55:54,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:55:54,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:55:54,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:55:54,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:55:54,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:55:54,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:55:54,201 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:55:54,201 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:55:54,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down.i [2019-09-08 02:55:54,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4818c5e/786d0f5d1b9e4776bb8647d96c59a294/FLAG4c15f4bb4 [2019-09-08 02:55:54,672 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:55:54,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i [2019-09-08 02:55:54,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4818c5e/786d0f5d1b9e4776bb8647d96c59a294/FLAG4c15f4bb4 [2019-09-08 02:55:55,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4818c5e/786d0f5d1b9e4776bb8647d96c59a294 [2019-09-08 02:55:55,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:55:55,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:55:55,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:55:55,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:55:55,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:55:55,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fffac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55, skipping insertion in model container [2019-09-08 02:55:55,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:55:55,153 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:55:55,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:55:55,348 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:55:55,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:55:55,382 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:55:55,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55 WrapperNode [2019-09-08 02:55:55,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:55:55,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:55:55,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:55:55,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:55:55,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (1/1) ... [2019-09-08 02:55:55,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:55:55,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:55:55,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:55:55,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:55:55,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (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-08 02:55:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:55:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:55:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:55:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:55:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:55:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 02:55:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:55:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:55:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:55:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:55:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:55:55,700 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:55:55,700 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 02:55:55,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:55:55 BoogieIcfgContainer [2019-09-08 02:55:55,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:55:55,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:55:55,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:55:55,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:55:55,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:55:55" (1/3) ... [2019-09-08 02:55:55,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc18278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:55:55, skipping insertion in model container [2019-09-08 02:55:55,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:55" (2/3) ... [2019-09-08 02:55:55,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc18278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:55:55, skipping insertion in model container [2019-09-08 02:55:55,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:55:55" (3/3) ... [2019-09-08 02:55:55,708 INFO L109 eAbstractionObserver]: Analyzing ICFG down.i [2019-09-08 02:55:55,723 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:55:55,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:55:55,753 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:55:55,779 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:55:55,780 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:55:55,780 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:55:55,780 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:55:55,780 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:55:55,781 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:55:55,781 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:55:55,781 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:55:55,781 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:55:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-08 02:55:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:55:55,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:55,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:55,805 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1785764952, now seen corresponding path program 1 times [2019-09-08 02:55:55,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:55,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:56,017 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-08 02:55:56,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:56,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:56,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:56,044 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-09-08 02:55:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:56,134 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-08 02:55:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:56,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-08 02:55:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:56,143 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:55:56,143 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 02:55:56,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 02:55:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 02:55:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:55:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-08 02:55:56,186 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-08 02:55:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:56,187 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-08 02:55:56,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-08 02:55:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:55:56,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:56,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:56,190 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1701245161, now seen corresponding path program 1 times [2019-09-08 02:55:56,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:56,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:56,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:56,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:56,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:55:56,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:55:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:55:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:56,348 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-08 02:55:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:56,424 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-08 02:55:56,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:55:56,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-08 02:55:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:56,427 INFO L225 Difference]: With dead ends: 29 [2019-09-08 02:55:56,427 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 02:55:56,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 02:55:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-08 02:55:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 02:55:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-08 02:55:56,444 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-09-08 02:55:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:56,445 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-08 02:55:56,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:55:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-08 02:55:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:55:56,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:56,447 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:56,448 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash -186817542, now seen corresponding path program 1 times [2019-09-08 02:55:56,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:56,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:56,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:56,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:56,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:56,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:56,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 02:55:56,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:56,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:56,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 02:55:56,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:55:56,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:55:56,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:56,633 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-09-08 02:55:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:56,724 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-09-08 02:55:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:55:56,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-08 02:55:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:56,727 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:55:56,727 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 02:55:56,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:55:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 02:55:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-08 02:55:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 02:55:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-08 02:55:56,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-09-08 02:55:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:56,735 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-08 02:55:56,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:55:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-08 02:55:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:55:56,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:56,736 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:56,737 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash 151164811, now seen corresponding path program 2 times [2019-09-08 02:55:56,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:56,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:56,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:56,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:56,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:56,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:55:56,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:56,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:55:56,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:56,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:55:56,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:56,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:55:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:56,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-08 02:55:56,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:55:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:55:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:55:56,907 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-09-08 02:55:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:56,982 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-08 02:55:56,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:55:56,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-09-08 02:55:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:56,984 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:55:56,984 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 02:55:56,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:55:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 02:55:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-09-08 02:55:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:55:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-08 02:55:57,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2019-09-08 02:55:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:57,008 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-08 02:55:57,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:55:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-08 02:55:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:55:57,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:57,011 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:57,011 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:57,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash -596024552, now seen corresponding path program 3 times [2019-09-08 02:55:57,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:57,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:55:57,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:57,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:55:57,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:57,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 02:55:57,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:57,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 02:55:57,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:55:57,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:57,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 02:55:57,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:55:57,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:55:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:55:57,185 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2019-09-08 02:55:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:57,291 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-08 02:55:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:55:57,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-08 02:55:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:57,293 INFO L225 Difference]: With dead ends: 49 [2019-09-08 02:55:57,293 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:55:57,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:55:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:55:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-08 02:55:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:55:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-08 02:55:57,300 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2019-09-08 02:55:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:57,300 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-08 02:55:57,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:55:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-08 02:55:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:55:57,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:57,302 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:57,302 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542807, now seen corresponding path program 4 times [2019-09-08 02:55:57,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:57,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:55:57,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:57,368 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-08 02:55:57,391 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:55:57,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:55:57,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:57,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:55:57,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:57,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:55:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:55:57,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:57,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-08 02:55:57,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:55:57,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:55:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:55:57,446 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2019-09-08 02:55:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:57,526 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-08 02:55:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:55:57,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-08 02:55:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:57,528 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:55:57,528 INFO L226 Difference]: Without dead ends: 43 [2019-09-08 02:55:57,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:55:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-08 02:55:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-08 02:55:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 02:55:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-08 02:55:57,537 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2019-09-08 02:55:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:57,537 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-08 02:55:57,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:55:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-08 02:55:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:55:57,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:57,539 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:57,539 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1844119354, now seen corresponding path program 5 times [2019-09-08 02:55:57,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:55:57,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:57,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:55:57,667 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:57,688 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 02:55:57,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:57,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 02:55:57,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:55:57,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:57,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 02:55:57,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:55:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:55:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:55:57,708 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2019-09-08 02:55:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:57,832 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-09-08 02:55:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:55:57,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-09-08 02:55:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:57,834 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:55:57,834 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:55:57,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:55:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:55:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-08 02:55:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 02:55:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-08 02:55:57,845 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2019-09-08 02:55:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:57,845 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-08 02:55:57,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:55:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-08 02:55:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 02:55:57,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:57,847 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:57,847 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash 528545995, now seen corresponding path program 6 times [2019-09-08 02:55:57,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:55:57,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:57,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:55:57,990 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 02:55:57,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:57,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:55:57,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:55:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:55:58,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-08 02:55:58,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 02:55:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 02:55:58,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:55:58,042 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-08 02:55:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:58,132 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-08 02:55:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 02:55:58,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-08 02:55:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:58,133 INFO L225 Difference]: With dead ends: 53 [2019-09-08 02:55:58,134 INFO L226 Difference]: Without dead ends: 51 [2019-09-08 02:55:58,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:55:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-08 02:55:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-09-08 02:55:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 02:55:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-08 02:55:58,141 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 37 [2019-09-08 02:55:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:58,141 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-08 02:55:58,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 02:55:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-08 02:55:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 02:55:58,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:58,143 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:58,143 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1720130008, now seen corresponding path program 7 times [2019-09-08 02:55:58,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:58,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 02:55:58,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:58,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:58,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:58,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:55:58,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 02:55:58,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:58,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 02:55:58,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:55:58,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:55:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:55:58,338 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2019-09-08 02:55:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:58,510 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-09-08 02:55:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:55:58,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-08 02:55:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:58,512 INFO L225 Difference]: With dead ends: 71 [2019-09-08 02:55:58,512 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 02:55:58,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:55:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 02:55:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-08 02:55:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 02:55:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-08 02:55:58,519 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2019-09-08 02:55:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:58,520 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-08 02:55:58,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:55:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-08 02:55:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 02:55:58,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:58,521 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:58,521 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 442428009, now seen corresponding path program 8 times [2019-09-08 02:55:58,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:58,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:58,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:58,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:58,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 02:55:58,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:58,610 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-08 02:55:58,625 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-08 02:55:58,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:55:58,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:58,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 02:55:58,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:58,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:55:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 02:55:58,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:58,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-08 02:55:58,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:55:58,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:55:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:55:58,699 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2019-09-08 02:55:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:58,782 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-08 02:55:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:55:58,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-09-08 02:55:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:58,783 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:55:58,783 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 02:55:58,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:55:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 02:55:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-08 02:55:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 02:55:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-08 02:55:58,796 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-09-08 02:55:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:58,797 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-08 02:55:58,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:55:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-08 02:55:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 02:55:58,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:58,800 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:58,800 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash 21084794, now seen corresponding path program 9 times [2019-09-08 02:55:58,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:58,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:58,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 02:55:58,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:58,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:55:58,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:55:58,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 02:55:58,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:58,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 02:55:58,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 02:55:59,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:59,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 02:55:59,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:55:59,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:55:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:55:59,035 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2019-09-08 02:55:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:59,225 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-09-08 02:55:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:55:59,226 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-09-08 02:55:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:59,227 INFO L225 Difference]: With dead ends: 82 [2019-09-08 02:55:59,227 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 02:55:59,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:55:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 02:55:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-08 02:55:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 02:55:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-08 02:55:59,240 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2019-09-08 02:55:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:59,240 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-08 02:55:59,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:55:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-08 02:55:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 02:55:59,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:59,243 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:59,243 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2096338421, now seen corresponding path program 10 times [2019-09-08 02:55:59,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:59,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:59,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 02:55:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:59,320 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-08 02:55:59,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:55:59,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:55:59,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:59,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 02:55:59,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:59,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:55:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 02:55:59,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:59,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-08 02:55:59,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:55:59,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:55:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:55:59,429 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-09-08 02:55:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:59,534 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-08 02:55:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:55:59,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-08 02:55:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:59,536 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:55:59,536 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:55:59,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:55:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:55:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-08 02:55:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 02:55:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-08 02:55:59,546 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 53 [2019-09-08 02:55:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:59,548 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-08 02:55:59,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:55:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-08 02:55:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 02:55:59,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:59,549 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:59,550 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1572192408, now seen corresponding path program 11 times [2019-09-08 02:55:59,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:59,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:59,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 02:55:59,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:55:59,692 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) [2019-09-08 02:55:59,705 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:55:59,733 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 02:55:59,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:55:59,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 02:55:59,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:55:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 02:55:59,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:55:59,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 02:55:59,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:55:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:55:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:55:59,754 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2019-09-08 02:55:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:59,986 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-08 02:55:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:55:59,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-09-08 02:55:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:59,987 INFO L225 Difference]: With dead ends: 93 [2019-09-08 02:55:59,987 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 02:55:59,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:55:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 02:55:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-08 02:55:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-08 02:55:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-08 02:55:59,995 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2019-09-08 02:55:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:59,995 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-08 02:55:59,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:55:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-08 02:55:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 02:55:59,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:59,996 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:59,996 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 941903657, now seen corresponding path program 12 times [2019-09-08 02:55:59,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:59,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:59,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:55:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 02:56:00,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:00,086 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) [2019-09-08 02:56:00,104 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:00,129 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 02:56:00,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:00,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 02:56:00,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:00,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 02:56:00,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:00,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-08 02:56:00,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:56:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:56:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:56:00,170 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2019-09-08 02:56:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:00,260 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-08 02:56:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:56:00,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-08 02:56:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:00,261 INFO L225 Difference]: With dead ends: 77 [2019-09-08 02:56:00,261 INFO L226 Difference]: Without dead ends: 75 [2019-09-08 02:56:00,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:56:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-08 02:56:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-08 02:56:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-08 02:56:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-08 02:56:00,268 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 61 [2019-09-08 02:56:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:00,269 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-08 02:56:00,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:56:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-08 02:56:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 02:56:00,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:00,270 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:00,270 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1438286406, now seen corresponding path program 13 times [2019-09-08 02:56:00,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:00,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:00,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:00,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 02:56:00,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:00,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 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-08 02:56:00,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:00,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 02:56:00,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 02:56:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:00,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-08 02:56:00,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:56:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:56:00,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:56:00,489 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2019-09-08 02:56:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:00,817 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2019-09-08 02:56:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:56:00,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-09-08 02:56:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:00,823 INFO L225 Difference]: With dead ends: 104 [2019-09-08 02:56:00,823 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 02:56:00,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:56:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 02:56:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-08 02:56:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-08 02:56:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-08 02:56:00,831 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2019-09-08 02:56:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:00,831 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-08 02:56:00,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:56:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-08 02:56:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 02:56:00,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:00,832 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:00,832 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 654895947, now seen corresponding path program 14 times [2019-09-08 02:56:00,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:00,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:00,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:00,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:00,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 02:56:00,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:00,924 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-08 02:56:00,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:56:00,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:00,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:00,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:56:00,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:00,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 02:56:01,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:01,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-08 02:56:01,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:56:01,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:56:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:56:01,010 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2019-09-08 02:56:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:01,094 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-08 02:56:01,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:56:01,095 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-09-08 02:56:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:01,096 INFO L225 Difference]: With dead ends: 85 [2019-09-08 02:56:01,097 INFO L226 Difference]: Without dead ends: 83 [2019-09-08 02:56:01,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:56:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-08 02:56:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-08 02:56:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 02:56:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-08 02:56:01,103 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-09-08 02:56:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:01,103 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-08 02:56:01,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:56:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-08 02:56:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 02:56:01,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:01,104 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:01,105 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash -165587112, now seen corresponding path program 15 times [2019-09-08 02:56:01,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:01,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:01,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 02:56:01,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:01,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:01,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:56:01,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-08 02:56:01,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:01,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 02:56:01,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 02:56:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 02:56:01,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:56:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:56:01,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:56:01,338 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2019-09-08 02:56:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:01,664 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-09-08 02:56:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:56:01,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-08 02:56:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:01,666 INFO L225 Difference]: With dead ends: 115 [2019-09-08 02:56:01,666 INFO L226 Difference]: Without dead ends: 80 [2019-09-08 02:56:01,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:56:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-08 02:56:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-08 02:56:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-08 02:56:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-08 02:56:01,674 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 76 [2019-09-08 02:56:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:01,674 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-08 02:56:01,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:56:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-08 02:56:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 02:56:01,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:01,675 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:01,675 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash 501916649, now seen corresponding path program 16 times [2019-09-08 02:56:01,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:01,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:01,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 02:56:01,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:01,777 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-08 02:56:01,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:56:01,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:01,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:01,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 02:56:01,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:01,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 02:56:01,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:01,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-09-08 02:56:01,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:56:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:56:01,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:56:01,855 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 16 states. [2019-09-08 02:56:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:01,975 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-08 02:56:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:56:01,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-08 02:56:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:01,977 INFO L225 Difference]: With dead ends: 93 [2019-09-08 02:56:01,977 INFO L226 Difference]: Without dead ends: 91 [2019-09-08 02:56:01,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:56:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-08 02:56:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-09-08 02:56:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-08 02:56:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-08 02:56:01,984 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 77 [2019-09-08 02:56:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:01,984 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-08 02:56:01,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:56:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-08 02:56:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 02:56:01,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:01,985 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:01,985 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1520807686, now seen corresponding path program 17 times [2019-09-08 02:56:01,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:01,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:01,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:01,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:01,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-08 02:56:02,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:02,194 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) [2019-09-08 02:56:02,221 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:02,254 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-08 02:56:02,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:02,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:56:02,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-08 02:56:02,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:02,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 02:56:02,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:56:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:56:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:56:02,277 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2019-09-08 02:56:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:02,630 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-09-08 02:56:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:56:02,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2019-09-08 02:56:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:02,632 INFO L225 Difference]: With dead ends: 126 [2019-09-08 02:56:02,632 INFO L226 Difference]: Without dead ends: 88 [2019-09-08 02:56:02,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:56:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-08 02:56:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-08 02:56:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-08 02:56:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-08 02:56:02,639 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 84 [2019-09-08 02:56:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:02,639 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-08 02:56:02,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:56:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-08 02:56:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 02:56:02,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:02,641 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:02,641 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1071283339, now seen corresponding path program 18 times [2019-09-08 02:56:02,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:02,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:02,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-08 02:56:02,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:02,752 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) [2019-09-08 02:56:02,767 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:02,798 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-08 02:56:02,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:02,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 02:56:02,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:02,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-08 02:56:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:02,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-08 02:56:02,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:56:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:56:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:56:02,851 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 17 states. [2019-09-08 02:56:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:02,967 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-08 02:56:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:56:02,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 02:56:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:02,968 INFO L225 Difference]: With dead ends: 101 [2019-09-08 02:56:02,968 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 02:56:02,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:56:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 02:56:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-09-08 02:56:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-08 02:56:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-08 02:56:02,975 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 85 [2019-09-08 02:56:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:02,975 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-08 02:56:02,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:56:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-08 02:56:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 02:56:02,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:02,976 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:02,976 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 48619032, now seen corresponding path program 19 times [2019-09-08 02:56:02,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:02,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:02,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 02:56:03,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:03,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:56:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:03,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 02:56:03,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 02:56:03,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:03,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-08 02:56:03,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:56:03,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:56:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:56:03,249 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2019-09-08 02:56:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:03,729 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-09-08 02:56:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:56:03,744 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-09-08 02:56:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:03,745 INFO L225 Difference]: With dead ends: 137 [2019-09-08 02:56:03,746 INFO L226 Difference]: Without dead ends: 96 [2019-09-08 02:56:03,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:56:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-08 02:56:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-08 02:56:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-08 02:56:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-08 02:56:03,753 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2019-09-08 02:56:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:03,753 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-08 02:56:03,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:56:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-08 02:56:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 02:56:03,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:03,755 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:03,755 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:03,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:03,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1764890455, now seen corresponding path program 20 times [2019-09-08 02:56:03,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:03,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:03,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:03,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 02:56:03,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:03,895 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-08 02:56:03,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:56:03,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:03,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:03,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 02:56:03,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:03,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:04,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:04,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-09-08 02:56:04,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:56:04,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:56:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:56:04,009 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 18 states. [2019-09-08 02:56:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:04,151 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-08 02:56:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:56:04,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-08 02:56:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:04,155 INFO L225 Difference]: With dead ends: 109 [2019-09-08 02:56:04,155 INFO L226 Difference]: Without dead ends: 107 [2019-09-08 02:56:04,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:56:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-08 02:56:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-08 02:56:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 02:56:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-08 02:56:04,166 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 93 [2019-09-08 02:56:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:04,166 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-08 02:56:04,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:56:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-08 02:56:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 02:56:04,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:04,167 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:04,167 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1343998918, now seen corresponding path program 21 times [2019-09-08 02:56:04,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:04,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:04,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-08 02:56:04,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:04,516 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) [2019-09-08 02:56:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:04,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-08 02:56:04,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:04,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 02:56:04,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-08 02:56:04,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:04,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-08 02:56:04,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:56:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:56:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:56:04,626 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2019-09-08 02:56:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:05,126 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-09-08 02:56:05,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:56:05,130 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-09-08 02:56:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:05,132 INFO L225 Difference]: With dead ends: 148 [2019-09-08 02:56:05,132 INFO L226 Difference]: Without dead ends: 104 [2019-09-08 02:56:05,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=1169, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:56:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-08 02:56:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-08 02:56:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 02:56:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-08 02:56:05,139 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 100 [2019-09-08 02:56:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:05,139 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-08 02:56:05,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:56:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-08 02:56:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 02:56:05,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:05,141 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:05,141 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2098913845, now seen corresponding path program 22 times [2019-09-08 02:56:05,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:05,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-08 02:56:05,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:05,283 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-08 02:56:05,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:56:05,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:05,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:05,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:56:05,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:05,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-08 02:56:05,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:05,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-09-08 02:56:05,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:56:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:56:05,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:56:05,368 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 19 states. [2019-09-08 02:56:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:05,502 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-08 02:56:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:56:05,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-08 02:56:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:05,504 INFO L225 Difference]: With dead ends: 117 [2019-09-08 02:56:05,504 INFO L226 Difference]: Without dead ends: 115 [2019-09-08 02:56:05,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:56:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-08 02:56:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-09-08 02:56:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-08 02:56:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-08 02:56:05,510 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 101 [2019-09-08 02:56:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:05,511 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-08 02:56:05,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:56:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-08 02:56:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 02:56:05,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:05,512 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:05,513 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:05,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1239460648, now seen corresponding path program 23 times [2019-09-08 02:56:05,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:05,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:05,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:05,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:05,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 02:56:05,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:05,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:56:05,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:56:06,036 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-08 02:56:06,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:06,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 02:56:06,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 02:56:06,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:06,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 02:56:06,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:56:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:56:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:56:06,062 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2019-09-08 02:56:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:06,605 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-09-08 02:56:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:56:06,605 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2019-09-08 02:56:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:06,606 INFO L225 Difference]: With dead ends: 159 [2019-09-08 02:56:06,607 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 02:56:06,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:56:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 02:56:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-08 02:56:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-08 02:56:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-08 02:56:06,614 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 108 [2019-09-08 02:56:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:06,615 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-08 02:56:06,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:56:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-08 02:56:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 02:56:06,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:06,616 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:06,616 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:06,617 INFO L82 PathProgramCache]: Analyzing trace with hash -857072279, now seen corresponding path program 24 times [2019-09-08 02:56:06,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:06,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:06,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:06,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:06,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 02:56:06,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:06,770 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-08 02:56:06,787 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-08 02:56:06,831 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 02:56:06,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:06,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 02:56:06,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:06,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 02:56:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-08 02:56:06,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:56:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:56:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:56:06,888 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 20 states. [2019-09-08 02:56:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:07,024 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-09-08 02:56:07,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:56:07,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-08 02:56:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:07,030 INFO L225 Difference]: With dead ends: 125 [2019-09-08 02:56:07,031 INFO L226 Difference]: Without dead ends: 123 [2019-09-08 02:56:07,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:56:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-08 02:56:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-08 02:56:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 02:56:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-08 02:56:07,039 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 109 [2019-09-08 02:56:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:07,039 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-08 02:56:07,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:56:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-08 02:56:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 02:56:07,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:07,041 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:07,041 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1212622714, now seen corresponding path program 25 times [2019-09-08 02:56:07,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:07,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:07,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:07,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:07,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-08 02:56:07,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:07,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:07,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:07,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:56:07,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 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-08 02:56:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:07,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 02:56:07,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:56:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:56:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:56:07,441 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2019-09-08 02:56:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:08,112 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-09-08 02:56:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:56:08,112 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-09-08 02:56:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:08,114 INFO L225 Difference]: With dead ends: 170 [2019-09-08 02:56:08,114 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 02:56:08,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=511, Invalid=1559, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:56:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 02:56:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-08 02:56:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-08 02:56:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-08 02:56:08,132 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2019-09-08 02:56:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:08,132 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-08 02:56:08,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:56:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-08 02:56:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 02:56:08,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:08,135 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:08,136 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1720504075, now seen corresponding path program 26 times [2019-09-08 02:56:08,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:08,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:08,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-08 02:56:08,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:08,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:08,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:56:08,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:08,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:08,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:56:08,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:08,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-08 02:56:08,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-09-08 02:56:08,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:56:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:56:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:56:08,417 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2019-09-08 02:56:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:08,598 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-09-08 02:56:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:56:08,598 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2019-09-08 02:56:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:08,600 INFO L225 Difference]: With dead ends: 133 [2019-09-08 02:56:08,600 INFO L226 Difference]: Without dead ends: 131 [2019-09-08 02:56:08,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:56:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-08 02:56:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-09-08 02:56:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-08 02:56:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-08 02:56:08,608 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 117 [2019-09-08 02:56:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:08,609 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-08 02:56:08,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:56:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-08 02:56:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 02:56:08,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:08,610 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:08,611 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1625930648, now seen corresponding path program 27 times [2019-09-08 02:56:08,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:08,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:08,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:08,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:08,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 02:56:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:09,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:56:09,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:09,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-08 02:56:09,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:09,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 02:56:09,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 02:56:09,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:09,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-08 02:56:09,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:56:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:56:09,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:56:09,150 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2019-09-08 02:56:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:09,574 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2019-09-08 02:56:09,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:56:09,574 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-09-08 02:56:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:09,576 INFO L225 Difference]: With dead ends: 181 [2019-09-08 02:56:09,576 INFO L226 Difference]: Without dead ends: 128 [2019-09-08 02:56:09,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=577, Invalid=1775, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:56:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-08 02:56:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-08 02:56:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-08 02:56:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-08 02:56:09,586 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 124 [2019-09-08 02:56:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:09,586 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-08 02:56:09,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:56:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-08 02:56:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 02:56:09,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:09,588 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:09,588 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash 156975657, now seen corresponding path program 28 times [2019-09-08 02:56:09,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:09,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:09,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:09,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 02:56:09,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:09,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:56:09,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:09,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:09,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:09,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:56:09,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:09,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:09,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:09,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-09-08 02:56:09,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:56:09,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:56:09,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:56:09,919 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 22 states. [2019-09-08 02:56:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:10,112 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-09-08 02:56:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 02:56:10,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-08 02:56:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:10,113 INFO L225 Difference]: With dead ends: 141 [2019-09-08 02:56:10,114 INFO L226 Difference]: Without dead ends: 139 [2019-09-08 02:56:10,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:56:10,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-08 02:56:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-08 02:56:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-08 02:56:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-09-08 02:56:10,125 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 125 [2019-09-08 02:56:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:10,125 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-09-08 02:56:10,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:56:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-09-08 02:56:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 02:56:10,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:10,128 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:10,129 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -303617350, now seen corresponding path program 29 times [2019-09-08 02:56:10,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:10,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:10,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-08 02:56:10,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:10,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:56:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:10,661 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-08 02:56:10,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:10,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:56:10,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-08 02:56:10,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:10,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 02:56:10,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:56:10,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:56:10,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:56:10,703 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2019-09-08 02:56:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:11,513 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2019-09-08 02:56:11,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:56:11,513 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-09-08 02:56:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:11,514 INFO L225 Difference]: With dead ends: 192 [2019-09-08 02:56:11,515 INFO L226 Difference]: Without dead ends: 136 [2019-09-08 02:56:11,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=647, Invalid=2005, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 02:56:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-08 02:56:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-08 02:56:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-08 02:56:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-08 02:56:11,524 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 132 [2019-09-08 02:56:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:11,524 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-08 02:56:11,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:56:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-08 02:56:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 02:56:11,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:11,526 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:11,526 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1647677515, now seen corresponding path program 30 times [2019-09-08 02:56:11,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:11,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:11,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-08 02:56:11,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:11,720 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-08 02:56:11,730 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:56:11,788 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-08 02:56:11,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:11,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:56:11,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:11,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-08 02:56:11,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:11,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-08 02:56:11,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 02:56:11,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 02:56:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:56:11,850 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 23 states. [2019-09-08 02:56:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:12,062 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-09-08 02:56:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 02:56:12,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-08 02:56:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:12,064 INFO L225 Difference]: With dead ends: 149 [2019-09-08 02:56:12,065 INFO L226 Difference]: Without dead ends: 147 [2019-09-08 02:56:12,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:56:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-08 02:56:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-08 02:56:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 02:56:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-09-08 02:56:12,073 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 133 [2019-09-08 02:56:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:12,074 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-09-08 02:56:12,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 02:56:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-09-08 02:56:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 02:56:12,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:12,075 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:12,076 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash 861999704, now seen corresponding path program 31 times [2019-09-08 02:56:12,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:12,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-08 02:56:12,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:12,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:12,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:56:12,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:12,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:12,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 02:56:12,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 02:56:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 02:56:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:56:12,585 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2019-09-08 02:56:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:13,433 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2019-09-08 02:56:13,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:56:13,433 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-09-08 02:56:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:13,434 INFO L225 Difference]: With dead ends: 203 [2019-09-08 02:56:13,434 INFO L226 Difference]: Without dead ends: 144 [2019-09-08 02:56:13,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=721, Invalid=2249, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:56:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-08 02:56:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-08 02:56:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-08 02:56:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-08 02:56:13,444 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 140 [2019-09-08 02:56:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:13,444 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-08 02:56:13,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 02:56:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-08 02:56:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 02:56:13,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:13,446 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:13,446 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1950177001, now seen corresponding path program 32 times [2019-09-08 02:56:13,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:13,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:13,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:13,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:13,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-08 02:56:13,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:13,661 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-08 02:56:13,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:56:13,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:13,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:13,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:56:13,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-08 02:56:13,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 02:56:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 02:56:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:56:13,783 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 24 states. [2019-09-08 02:56:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:13,984 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-09-08 02:56:13,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 02:56:13,985 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2019-09-08 02:56:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:13,986 INFO L225 Difference]: With dead ends: 157 [2019-09-08 02:56:13,987 INFO L226 Difference]: Without dead ends: 155 [2019-09-08 02:56:13,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:56:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-08 02:56:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-09-08 02:56:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-08 02:56:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-09-08 02:56:13,998 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2019-09-08 02:56:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:13,998 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-09-08 02:56:13,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 02:56:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-09-08 02:56:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 02:56:13,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:14,000 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:14,000 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1630027258, now seen corresponding path program 33 times [2019-09-08 02:56:14,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:14,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-08 02:56:14,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:14,512 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-08 02:56:14,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:56:14,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-08 02:56:14,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:14,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:56:14,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-08 02:56:14,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:14,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 02:56:14,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:56:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:56:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:56:14,634 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2019-09-08 02:56:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:15,580 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2019-09-08 02:56:15,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:56:15,581 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2019-09-08 02:56:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:15,582 INFO L225 Difference]: With dead ends: 214 [2019-09-08 02:56:15,582 INFO L226 Difference]: Without dead ends: 152 [2019-09-08 02:56:15,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=799, Invalid=2507, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:56:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-08 02:56:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-08 02:56:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-08 02:56:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-08 02:56:15,595 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 148 [2019-09-08 02:56:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:15,595 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-08 02:56:15,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:56:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-08 02:56:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 02:56:15,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:15,596 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:15,597 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash 776167819, now seen corresponding path program 34 times [2019-09-08 02:56:15,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:15,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:15,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-08 02:56:15,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:15,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 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-08 02:56:15,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:56:15,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:15,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:15,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 02:56:15,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:15,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-08 02:56:15,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:15,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-09-08 02:56:15,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:56:15,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:56:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:56:15,979 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 25 states. [2019-09-08 02:56:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:16,251 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2019-09-08 02:56:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 02:56:16,252 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-09-08 02:56:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:16,253 INFO L225 Difference]: With dead ends: 165 [2019-09-08 02:56:16,254 INFO L226 Difference]: Without dead ends: 163 [2019-09-08 02:56:16,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:56:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-08 02:56:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-08 02:56:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-08 02:56:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-08 02:56:16,264 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2019-09-08 02:56:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:16,265 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-08 02:56:16,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:56:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-08 02:56:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 02:56:16,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:16,266 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:16,266 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:16,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash -56534760, now seen corresponding path program 35 times [2019-09-08 02:56:16,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:16,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:16,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:16,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:16,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-08 02:56:16,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:16,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 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-08 02:56:16,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:56:16,901 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-08 02:56:16,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:16,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:56:16,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-08 02:56:16,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:16,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 02:56:16,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 02:56:16,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 02:56:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:56:16,939 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2019-09-08 02:56:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:17,885 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2019-09-08 02:56:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:56:17,889 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-09-08 02:56:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:17,891 INFO L225 Difference]: With dead ends: 225 [2019-09-08 02:56:17,891 INFO L226 Difference]: Without dead ends: 160 [2019-09-08 02:56:17,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=881, Invalid=2779, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 02:56:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-08 02:56:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-08 02:56:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-08 02:56:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-08 02:56:17,902 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 156 [2019-09-08 02:56:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:17,904 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-08 02:56:17,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 02:56:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-08 02:56:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 02:56:17,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:17,905 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:17,905 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash -726901847, now seen corresponding path program 36 times [2019-09-08 02:56:17,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:17,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:17,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-08 02:56:18,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:18,189 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) [2019-09-08 02:56:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:18,281 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 02:56:18,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:18,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 02:56:18,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-08 02:56:18,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:18,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-08 02:56:18,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:56:18,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:56:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:56:18,362 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 26 states. [2019-09-08 02:56:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:18,573 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-09-08 02:56:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:56:18,573 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-09-08 02:56:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:18,574 INFO L225 Difference]: With dead ends: 173 [2019-09-08 02:56:18,575 INFO L226 Difference]: Without dead ends: 171 [2019-09-08 02:56:18,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:56:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-08 02:56:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-09-08 02:56:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-08 02:56:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-09-08 02:56:18,584 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 157 [2019-09-08 02:56:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:18,584 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-09-08 02:56:18,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:56:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-09-08 02:56:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 02:56:18,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:18,586 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:18,586 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash -479305414, now seen corresponding path program 37 times [2019-09-08 02:56:18,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:18,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-08 02:56:19,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:19,160 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-08 02:56:19,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:19,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 02:56:19,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:19,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:19,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 02:56:19,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 02:56:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 02:56:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:56:19,268 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2019-09-08 02:56:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:20,380 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2019-09-08 02:56:20,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 02:56:20,383 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-09-08 02:56:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:20,384 INFO L225 Difference]: With dead ends: 236 [2019-09-08 02:56:20,384 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 02:56:20,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:56:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 02:56:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-08 02:56:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 02:56:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-08 02:56:20,395 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 164 [2019-09-08 02:56:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:20,395 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-08 02:56:20,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 02:56:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-08 02:56:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 02:56:20,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:20,398 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:20,398 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash 68829899, now seen corresponding path program 38 times [2019-09-08 02:56:20,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:20,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:20,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:20,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-08 02:56:20,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:20,698 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-08 02:56:20,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:56:20,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:20,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:20,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 02:56:20,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Stream closed [2019-09-08 02:56:20,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:20,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-09-08 02:56:20,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:56:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:56:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:56:20,839 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 27 states. [2019-09-08 02:56:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:21,052 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2019-09-08 02:56:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:56:21,055 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 165 [2019-09-08 02:56:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:21,058 INFO L225 Difference]: With dead ends: 181 [2019-09-08 02:56:21,058 INFO L226 Difference]: Without dead ends: 179 [2019-09-08 02:56:21,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:56:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-08 02:56:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2019-09-08 02:56:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-08 02:56:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-08 02:56:21,072 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 165 [2019-09-08 02:56:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:21,073 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-08 02:56:21,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:56:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-08 02:56:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 02:56:21,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:21,075 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:21,076 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash -356085800, now seen corresponding path program 39 times [2019-09-08 02:56:21,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:21,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:21,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:21,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:21,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-08 02:56:21,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:21,980 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-08 02:56:21,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:56:22,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-08 02:56:22,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:22,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 02:56:22,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 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-08 02:56:22,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 02:56:22,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:56:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:56:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:56:22,102 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2019-09-08 02:56:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:23,369 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2019-09-08 02:56:23,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:56:23,373 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2019-09-08 02:56:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:23,375 INFO L225 Difference]: With dead ends: 247 [2019-09-08 02:56:23,375 INFO L226 Difference]: Without dead ends: 176 [2019-09-08 02:56:23,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1057, Invalid=3365, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 02:56:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-08 02:56:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-08 02:56:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-08 02:56:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-08 02:56:23,391 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 172 [2019-09-08 02:56:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:23,392 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-08 02:56:23,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:56:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-08 02:56:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 02:56:23,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:23,393 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:23,393 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1355042921, now seen corresponding path program 40 times [2019-09-08 02:56:23,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:23,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:23,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:23,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-08 02:56:23,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:23,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:56:23,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:23,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:23,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 02:56:23,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-08 02:56:24,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2019-09-08 02:56:24,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 02:56:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 02:56:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:56:24,007 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 28 states. [2019-09-08 02:56:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:24,212 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2019-09-08 02:56:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:56:24,213 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 173 [2019-09-08 02:56:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:24,214 INFO L225 Difference]: With dead ends: 189 [2019-09-08 02:56:24,214 INFO L226 Difference]: Without dead ends: 187 [2019-09-08 02:56:24,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:56:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-08 02:56:24,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-08 02:56:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-08 02:56:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-09-08 02:56:24,224 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 173 [2019-09-08 02:56:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:24,225 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-09-08 02:56:24,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 02:56:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-09-08 02:56:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 02:56:24,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:24,226 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:24,226 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:24,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1998427258, now seen corresponding path program 41 times [2019-09-08 02:56:24,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:24,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:24,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:24,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:24,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-08 02:56:24,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:24,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 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-08 02:56:24,910 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:56:25,006 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-08 02:56:25,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:25,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 02:56:25,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:25,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:25,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 02:56:25,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 02:56:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 02:56:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:56:25,058 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2019-09-08 02:56:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:26,510 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2019-09-08 02:56:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 02:56:26,510 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2019-09-08 02:56:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:26,511 INFO L225 Difference]: With dead ends: 258 [2019-09-08 02:56:26,512 INFO L226 Difference]: Without dead ends: 184 [2019-09-08 02:56:26,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1151, Invalid=3679, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 02:56:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-08 02:56:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-08 02:56:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-08 02:56:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-08 02:56:26,523 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 180 [2019-09-08 02:56:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:26,523 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-08 02:56:26,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 02:56:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-08 02:56:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 02:56:26,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:26,525 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:26,525 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -568445941, now seen corresponding path program 42 times [2019-09-08 02:56:26,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:26,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:26,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:26,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:26,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-08 02:56:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:26,884 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-08 02:56:26,899 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:56:26,999 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-08 02:56:26,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:27,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 02:56:27,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-08 02:56:27,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:27,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-08 02:56:27,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:56:27,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:56:27,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:56:27,119 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 29 states. [2019-09-08 02:56:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:27,387 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2019-09-08 02:56:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 02:56:27,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 181 [2019-09-08 02:56:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:27,389 INFO L225 Difference]: With dead ends: 197 [2019-09-08 02:56:27,389 INFO L226 Difference]: Without dead ends: 195 [2019-09-08 02:56:27,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:56:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-08 02:56:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-09-08 02:56:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-08 02:56:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-09-08 02:56:27,398 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 181 [2019-09-08 02:56:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:27,399 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-09-08 02:56:27,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:56:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-09-08 02:56:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 02:56:27,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:27,400 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:27,401 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1257027224, now seen corresponding path program 43 times [2019-09-08 02:56:27,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:27,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:27,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 02:56:28,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:28,229 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-08 02:56:28,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:28,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 02:56:28,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 02:56:28,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:28,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 02:56:28,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 02:56:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 02:56:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:56:28,351 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2019-09-08 02:56:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:29,909 INFO L93 Difference]: Finished difference Result 269 states and 293 transitions. [2019-09-08 02:56:29,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 02:56:29,909 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2019-09-08 02:56:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:29,911 INFO L225 Difference]: With dead ends: 269 [2019-09-08 02:56:29,911 INFO L226 Difference]: Without dead ends: 192 [2019-09-08 02:56:29,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1249, Invalid=4007, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 02:56:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-08 02:56:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-09-08 02:56:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-08 02:56:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-08 02:56:29,923 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 188 [2019-09-08 02:56:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:29,923 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-08 02:56:29,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 02:56:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-08 02:56:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 02:56:29,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:29,924 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:29,925 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash 765539625, now seen corresponding path program 44 times [2019-09-08 02:56:29,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:29,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 02:56:30,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:30,299 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) [2019-09-08 02:56:30,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:30,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:30,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:30,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 02:56:30,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:30,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-08 02:56:30,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:30,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2019-09-08 02:56:30,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:56:30,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:56:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:56:30,510 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 30 states. [2019-09-08 02:56:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:30,745 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2019-09-08 02:56:30,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:56:30,745 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 189 [2019-09-08 02:56:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:30,747 INFO L225 Difference]: With dead ends: 205 [2019-09-08 02:56:30,747 INFO L226 Difference]: Without dead ends: 203 [2019-09-08 02:56:30,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:56:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-08 02:56:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-08 02:56:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 02:56:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-09-08 02:56:30,757 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 189 [2019-09-08 02:56:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:30,757 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-09-08 02:56:30,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:56:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-09-08 02:56:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 02:56:30,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:30,759 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:30,759 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash 530175930, now seen corresponding path program 45 times [2019-09-08 02:56:30,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:30,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-08 02:56:31,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:31,699 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-08 02:56:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:56:31,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-08 02:56:31,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:31,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 02:56:31,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:31,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 02:56:31,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 02:56:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 02:56:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:56:31,833 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2019-09-08 02:56:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:33,389 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2019-09-08 02:56:33,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 02:56:33,394 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2019-09-08 02:56:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:33,396 INFO L225 Difference]: With dead ends: 280 [2019-09-08 02:56:33,396 INFO L226 Difference]: Without dead ends: 200 [2019-09-08 02:56:33,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1351, Invalid=4349, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 02:56:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-08 02:56:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-09-08 02:56:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-08 02:56:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-08 02:56:33,408 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 196 [2019-09-08 02:56:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:33,408 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-08 02:56:33,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 02:56:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-08 02:56:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 02:56:33,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:33,410 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:33,410 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1212992181, now seen corresponding path program 46 times [2019-09-08 02:56:33,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:33,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:33,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:33,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:33,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-08 02:56:33,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:33,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:33,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:56:33,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:33,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:33,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 02:56:33,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:33,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-08 02:56:33,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-09-08 02:56:33,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 02:56:33,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 02:56:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-08 02:56:33,944 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 31 states. [2019-09-08 02:56:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:34,226 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2019-09-08 02:56:34,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 02:56:34,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 197 [2019-09-08 02:56:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:34,229 INFO L225 Difference]: With dead ends: 213 [2019-09-08 02:56:34,229 INFO L226 Difference]: Without dead ends: 211 [2019-09-08 02:56:34,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:56:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-08 02:56:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-09-08 02:56:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 02:56:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-09-08 02:56:34,240 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2019-09-08 02:56:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:34,240 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-09-08 02:56:34,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 02:56:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-09-08 02:56:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 02:56:34,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:34,242 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:34,242 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1227869528, now seen corresponding path program 47 times [2019-09-08 02:56:34,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:34,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:34,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-08 02:56:35,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:35,058 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-08 02:56:35,068 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:56:35,145 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-08 02:56:35,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:35,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 02:56:35,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:35,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:35,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-08 02:56:35,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 02:56:35,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 02:56:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:56:35,200 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2019-09-08 02:56:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:36,942 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2019-09-08 02:56:36,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 02:56:36,942 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2019-09-08 02:56:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:36,943 INFO L225 Difference]: With dead ends: 291 [2019-09-08 02:56:36,944 INFO L226 Difference]: Without dead ends: 208 [2019-09-08 02:56:36,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1457, Invalid=4705, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 02:56:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-08 02:56:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-09-08 02:56:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-08 02:56:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-08 02:56:36,955 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 204 [2019-09-08 02:56:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:36,955 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-08 02:56:36,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 02:56:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-08 02:56:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 02:56:36,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:36,957 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:36,957 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1889596951, now seen corresponding path program 48 times [2019-09-08 02:56:36,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:36,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:36,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-08 02:56:37,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:37,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:56:37,392 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:37,490 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 02:56:37,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:37,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 02:56:37,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:37,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-08 02:56:37,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:37,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-08 02:56:37,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:56:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:56:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:56:37,585 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 32 states. [2019-09-08 02:56:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:37,969 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2019-09-08 02:56:37,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 02:56:37,969 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-09-08 02:56:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:37,972 INFO L225 Difference]: With dead ends: 221 [2019-09-08 02:56:37,972 INFO L226 Difference]: Without dead ends: 219 [2019-09-08 02:56:37,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:56:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-08 02:56:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2019-09-08 02:56:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-08 02:56:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-09-08 02:56:37,988 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 205 [2019-09-08 02:56:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:37,989 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-09-08 02:56:37,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:56:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-09-08 02:56:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 02:56:37,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:37,991 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:37,992 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 558312186, now seen corresponding path program 49 times [2019-09-08 02:56:37,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:37,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:37,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-08 02:56:39,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:39,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 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-08 02:56:39,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:39,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 02:56:39,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-08 02:56:39,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:39,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-08 02:56:39,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 02:56:39,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 02:56:39,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:56:39,531 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2019-09-08 02:56:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:41,447 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2019-09-08 02:56:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 02:56:41,448 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2019-09-08 02:56:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:41,450 INFO L225 Difference]: With dead ends: 302 [2019-09-08 02:56:41,450 INFO L226 Difference]: Without dead ends: 216 [2019-09-08 02:56:41,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1567, Invalid=5075, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 02:56:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-08 02:56:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-08 02:56:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-08 02:56:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2019-09-08 02:56:41,466 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 212 [2019-09-08 02:56:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:41,466 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2019-09-08 02:56:41,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 02:56:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2019-09-08 02:56:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 02:56:41,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:41,469 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:41,469 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash -851622261, now seen corresponding path program 50 times [2019-09-08 02:56:41,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:41,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:41,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-08 02:56:41,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:41,884 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) [2019-09-08 02:56:41,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:41,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:41,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:41,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 02:56:41,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:41,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-08 02:56:42,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:42,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-09-08 02:56:42,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 02:56:42,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 02:56:42,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 02:56:42,059 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 33 states. [2019-09-08 02:56:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:42,334 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2019-09-08 02:56:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 02:56:42,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 213 [2019-09-08 02:56:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:42,336 INFO L225 Difference]: With dead ends: 229 [2019-09-08 02:56:42,337 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 02:56:42,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=422, Invalid=700, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:56:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 02:56:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-08 02:56:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-08 02:56:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-09-08 02:56:42,348 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 213 [2019-09-08 02:56:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:42,348 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-09-08 02:56:42,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 02:56:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-09-08 02:56:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 02:56:42,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:42,350 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:42,350 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1330916328, now seen corresponding path program 51 times [2019-09-08 02:56:42,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:42,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:42,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:42,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:42,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-08 02:56:43,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:43,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 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-08 02:56:43,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:56:43,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-08 02:56:43,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:43,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 02:56:43,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-08 02:56:43,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:43,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-08 02:56:43,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 02:56:43,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 02:56:43,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:56:43,453 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2019-09-08 02:56:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:44,541 INFO L93 Difference]: Finished difference Result 313 states and 341 transitions. [2019-09-08 02:56:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 02:56:44,541 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2019-09-08 02:56:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:44,542 INFO L225 Difference]: With dead ends: 313 [2019-09-08 02:56:44,542 INFO L226 Difference]: Without dead ends: 224 [2019-09-08 02:56:44,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1681, Invalid=5459, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 02:56:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-08 02:56:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-08 02:56:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-08 02:56:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2019-09-08 02:56:44,554 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 220 [2019-09-08 02:56:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:44,555 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2019-09-08 02:56:44,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 02:56:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2019-09-08 02:56:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 02:56:44,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:44,556 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:44,556 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash 957992617, now seen corresponding path program 52 times [2019-09-08 02:56:44,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:44,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:44,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-08 02:56:44,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:44,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:44,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:56:45,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:45,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:45,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 02:56:45,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:45,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2019-09-08 02:56:45,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 02:56:45,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 02:56:45,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 02:56:45,151 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 34 states. [2019-09-08 02:56:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:45,467 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2019-09-08 02:56:45,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:56:45,467 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 221 [2019-09-08 02:56:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:45,470 INFO L225 Difference]: With dead ends: 237 [2019-09-08 02:56:45,470 INFO L226 Difference]: Without dead ends: 235 [2019-09-08 02:56:45,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:56:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-08 02:56:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-09-08 02:56:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-08 02:56:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-09-08 02:56:45,482 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 221 [2019-09-08 02:56:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:45,482 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-09-08 02:56:45,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 02:56:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-09-08 02:56:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 02:56:45,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:45,484 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:45,484 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1099533882, now seen corresponding path program 53 times [2019-09-08 02:56:45,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:45,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-08 02:56:46,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:46,588 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) [2019-09-08 02:56:46,607 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:46,707 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-08 02:56:46,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:46,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 02:56:46,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-08 02:56:46,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:46,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-08 02:56:46,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 02:56:46,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 02:56:46,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 02:56:46,767 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2019-09-08 02:56:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:49,004 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions. [2019-09-08 02:56:49,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 02:56:49,005 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2019-09-08 02:56:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:49,006 INFO L225 Difference]: With dead ends: 324 [2019-09-08 02:56:49,007 INFO L226 Difference]: Without dead ends: 232 [2019-09-08 02:56:49,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1799, Invalid=5857, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 02:56:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-08 02:56:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-08 02:56:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-08 02:56:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2019-09-08 02:56:49,019 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 228 [2019-09-08 02:56:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:49,019 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2019-09-08 02:56:49,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 02:56:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2019-09-08 02:56:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 02:56:49,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:49,021 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:49,021 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -601856053, now seen corresponding path program 54 times [2019-09-08 02:56:49,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:49,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:49,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:49,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-08 02:56:49,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:49,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 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-08 02:56:49,690 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:56:49,806 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-08 02:56:49,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:49,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 02:56:49,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (55)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:56:49,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:49,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-08 02:56:49,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:56:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:56:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:56:49,902 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 35 states. [2019-09-08 02:56:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:50,232 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2019-09-08 02:56:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 02:56:50,233 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2019-09-08 02:56:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:50,235 INFO L225 Difference]: With dead ends: 245 [2019-09-08 02:56:50,235 INFO L226 Difference]: Without dead ends: 243 [2019-09-08 02:56:50,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:56:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-08 02:56:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-09-08 02:56:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-08 02:56:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-09-08 02:56:50,247 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 229 [2019-09-08 02:56:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:50,247 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-09-08 02:56:50,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:56:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-09-08 02:56:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 02:56:50,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:50,249 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:50,249 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1417884968, now seen corresponding path program 55 times [2019-09-08 02:56:50,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:50,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-08 02:56:51,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:51,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:56:51,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:51,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 02:56:51,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-08 02:56:51,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:51,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-08 02:56:51,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 02:56:51,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 02:56:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 02:56:51,548 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2019-09-08 02:56:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:53,771 INFO L93 Difference]: Finished difference Result 335 states and 365 transitions. [2019-09-08 02:56:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 02:56:53,772 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2019-09-08 02:56:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:53,773 INFO L225 Difference]: With dead ends: 335 [2019-09-08 02:56:53,773 INFO L226 Difference]: Without dead ends: 240 [2019-09-08 02:56:53,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1921, Invalid=6269, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 02:56:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-08 02:56:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-08 02:56:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 02:56:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2019-09-08 02:56:53,786 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 236 [2019-09-08 02:56:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:53,786 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2019-09-08 02:56:53,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 02:56:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2019-09-08 02:56:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 02:56:53,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:53,788 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:53,788 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1290634089, now seen corresponding path program 56 times [2019-09-08 02:56:53,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:53,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:53,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:53,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:56:53,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-08 02:56:54,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:54,368 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-08 02:56:54,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:56:54,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:56:54,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:54,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 02:56:54,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:54,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-08 02:56:54,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:54,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2019-09-08 02:56:54,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 02:56:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 02:56:54,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:56:54,561 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 36 states. [2019-09-08 02:56:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:54,810 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2019-09-08 02:56:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:56:54,810 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 237 [2019-09-08 02:56:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:54,812 INFO L225 Difference]: With dead ends: 253 [2019-09-08 02:56:54,812 INFO L226 Difference]: Without dead ends: 251 [2019-09-08 02:56:54,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:56:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-08 02:56:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2019-09-08 02:56:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-08 02:56:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2019-09-08 02:56:54,824 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2019-09-08 02:56:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:54,825 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2019-09-08 02:56:54,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 02:56:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2019-09-08 02:56:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 02:56:54,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:54,826 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:54,827 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 113574266, now seen corresponding path program 57 times [2019-09-08 02:56:54,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:54,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-08 02:56:55,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:55,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:56:55,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:56:56,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-08 02:56:56,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:56,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 02:56:56,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-08 02:56:56,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:56,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-08 02:56:56,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 02:56:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 02:56:56,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 02:56:56,121 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2019-09-08 02:56:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:58,586 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2019-09-08 02:56:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 02:56:58,586 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2019-09-08 02:56:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:58,588 INFO L225 Difference]: With dead ends: 346 [2019-09-08 02:56:58,588 INFO L226 Difference]: Without dead ends: 248 [2019-09-08 02:56:58,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2047, Invalid=6695, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 02:56:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-08 02:56:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-09-08 02:56:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 02:56:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2019-09-08 02:56:58,602 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 244 [2019-09-08 02:56:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:58,602 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2019-09-08 02:56:58,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 02:56:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2019-09-08 02:56:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 02:56:58,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:58,604 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:58,604 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1656789259, now seen corresponding path program 58 times [2019-09-08 02:56:58,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:58,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:56:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-08 02:56:59,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:56:59,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:56:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:56:59,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:56:59,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:56:59,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 02:56:59,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:56:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:56:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-08 02:56:59,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:56:59,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-09-08 02:56:59,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 02:56:59,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 02:56:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 02:56:59,372 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 37 states. [2019-09-08 02:56:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:56:59,723 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2019-09-08 02:56:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 02:56:59,723 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 245 [2019-09-08 02:56:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:56:59,725 INFO L225 Difference]: With dead ends: 261 [2019-09-08 02:56:59,726 INFO L226 Difference]: Without dead ends: 259 [2019-09-08 02:56:59,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:56:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-08 02:56:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-08 02:56:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 02:56:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-09-08 02:56:59,739 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 245 [2019-09-08 02:56:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:56:59,739 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2019-09-08 02:56:59,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 02:56:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2019-09-08 02:56:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 02:56:59,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:56:59,741 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:56:59,741 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:56:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:56:59,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2101431912, now seen corresponding path program 59 times [2019-09-08 02:56:59,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:56:59,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:56:59,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:59,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:56:59,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:56:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-08 02:57:01,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:01,112 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-08 02:57:01,123 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:57:01,239 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-08 02:57:01,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:01,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 02:57:01,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-08 02:57:01,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:01,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-08 02:57:01,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 02:57:01,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 02:57:01,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 02:57:01,306 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2019-09-08 02:57:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:03,910 INFO L93 Difference]: Finished difference Result 357 states and 389 transitions. [2019-09-08 02:57:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 02:57:03,910 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-08 02:57:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:03,912 INFO L225 Difference]: With dead ends: 357 [2019-09-08 02:57:03,912 INFO L226 Difference]: Without dead ends: 256 [2019-09-08 02:57:03,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2177, Invalid=7135, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 02:57:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-08 02:57:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-09-08 02:57:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-08 02:57:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2019-09-08 02:57:03,925 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 252 [2019-09-08 02:57:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:03,925 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2019-09-08 02:57:03,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 02:57:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2019-09-08 02:57:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 02:57:03,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:03,927 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:03,927 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash 200681513, now seen corresponding path program 60 times [2019-09-08 02:57:03,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:03,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:03,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-08 02:57:04,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:04,432 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-08 02:57:04,442 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:57:04,554 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 02:57:04,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:04,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 02:57:04,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:04,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-08 02:57:04,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:04,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-08 02:57:04,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 02:57:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 02:57:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:57:04,656 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2019-09-08 02:57:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:05,011 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2019-09-08 02:57:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 02:57:05,011 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-09-08 02:57:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:05,014 INFO L225 Difference]: With dead ends: 269 [2019-09-08 02:57:05,014 INFO L226 Difference]: Without dead ends: 267 [2019-09-08 02:57:05,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:57:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-08 02:57:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-08 02:57:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-08 02:57:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2019-09-08 02:57:05,027 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2019-09-08 02:57:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:05,028 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2019-09-08 02:57:05,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 02:57:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2019-09-08 02:57:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 02:57:05,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:05,030 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:05,030 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash -128088902, now seen corresponding path program 61 times [2019-09-08 02:57:05,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:05,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:05,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:05,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:05,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-08 02:57:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:06,303 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-08 02:57:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:57:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:06,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 02:57:06,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-08 02:57:06,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:06,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-08 02:57:06,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 02:57:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 02:57:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 02:57:06,442 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2019-09-08 02:57:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:07,829 INFO L93 Difference]: Finished difference Result 368 states and 401 transitions. [2019-09-08 02:57:07,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 02:57:07,830 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2019-09-08 02:57:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:07,831 INFO L225 Difference]: With dead ends: 368 [2019-09-08 02:57:07,831 INFO L226 Difference]: Without dead ends: 264 [2019-09-08 02:57:07,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2311, Invalid=7589, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 02:57:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-08 02:57:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-09-08 02:57:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-08 02:57:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2019-09-08 02:57:07,845 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 260 [2019-09-08 02:57:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:07,845 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2019-09-08 02:57:07,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 02:57:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2019-09-08 02:57:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 02:57:07,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:07,847 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:07,847 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash -528360885, now seen corresponding path program 62 times [2019-09-08 02:57:07,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:57:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-08 02:57:08,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:08,453 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-08 02:57:08,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:57:08,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:57:08,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:08,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 02:57:08,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:08,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-08 02:57:08,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:08,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-09-08 02:57:08,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 02:57:08,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 02:57:08,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 02:57:08,636 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 39 states. [2019-09-08 02:57:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:08,955 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2019-09-08 02:57:08,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 02:57:08,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-09-08 02:57:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:08,958 INFO L225 Difference]: With dead ends: 277 [2019-09-08 02:57:08,958 INFO L226 Difference]: Without dead ends: 275 [2019-09-08 02:57:08,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=611, Invalid=949, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:57:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-08 02:57:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2019-09-08 02:57:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-08 02:57:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2019-09-08 02:57:08,972 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 261 [2019-09-08 02:57:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:08,972 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2019-09-08 02:57:08,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 02:57:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2019-09-08 02:57:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 02:57:08,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:08,974 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:08,975 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1586333784, now seen corresponding path program 63 times [2019-09-08 02:57:08,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:08,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:08,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:08,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:08,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-08 02:57:10,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:10,309 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-08 02:57:10,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:57:10,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-08 02:57:10,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:10,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 02:57:10,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-08 02:57:10,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:10,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-08 02:57:10,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 02:57:10,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 02:57:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 02:57:10,493 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2019-09-08 02:57:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:13,408 INFO L93 Difference]: Finished difference Result 379 states and 413 transitions. [2019-09-08 02:57:13,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 02:57:13,408 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2019-09-08 02:57:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:13,410 INFO L225 Difference]: With dead ends: 379 [2019-09-08 02:57:13,410 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 02:57:13,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2449, Invalid=8057, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 02:57:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 02:57:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-08 02:57:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-08 02:57:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 273 transitions. [2019-09-08 02:57:13,425 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 273 transitions. Word has length 268 [2019-09-08 02:57:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:13,425 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 273 transitions. [2019-09-08 02:57:13,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 02:57:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 273 transitions. [2019-09-08 02:57:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 02:57:13,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:13,427 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:13,428 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:13,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1773159191, now seen corresponding path program 64 times [2019-09-08 02:57:13,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:13,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:13,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:13,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:13,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-08 02:57:14,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:14,070 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) [2019-09-08 02:57:14,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:57:14,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:57:14,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:14,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 02:57:14,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-08 02:57:14,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:14,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2019-09-08 02:57:14,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 02:57:14,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 02:57:14,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:57:14,282 INFO L87 Difference]: Start difference. First operand 272 states and 273 transitions. Second operand 40 states. [2019-09-08 02:57:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:14,596 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2019-09-08 02:57:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:57:14,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-08 02:57:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:14,598 INFO L225 Difference]: With dead ends: 285 [2019-09-08 02:57:14,598 INFO L226 Difference]: Without dead ends: 283 [2019-09-08 02:57:14,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:57:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-08 02:57:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2019-09-08 02:57:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-08 02:57:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2019-09-08 02:57:14,612 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 269 [2019-09-08 02:57:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:14,612 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2019-09-08 02:57:14,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 02:57:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2019-09-08 02:57:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 02:57:14,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:14,615 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:14,615 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -558426118, now seen corresponding path program 65 times [2019-09-08 02:57:14,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:14,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:14,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:14,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:14,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-08 02:57:16,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:16,049 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-08 02:57:16,058 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:57:16,166 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-08 02:57:16,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:16,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 02:57:16,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-08 02:57:16,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:16,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-08 02:57:16,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-08 02:57:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-08 02:57:16,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 02:57:16,222 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2019-09-08 02:57:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:19,363 INFO L93 Difference]: Finished difference Result 390 states and 425 transitions. [2019-09-08 02:57:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 02:57:19,368 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2019-09-08 02:57:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:19,370 INFO L225 Difference]: With dead ends: 390 [2019-09-08 02:57:19,370 INFO L226 Difference]: Without dead ends: 280 [2019-09-08 02:57:19,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2591, Invalid=8539, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 02:57:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-08 02:57:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-08 02:57:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-08 02:57:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2019-09-08 02:57:19,385 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 276 [2019-09-08 02:57:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:19,385 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2019-09-08 02:57:19,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-08 02:57:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2019-09-08 02:57:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 02:57:19,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:19,387 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:19,387 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 365439883, now seen corresponding path program 66 times [2019-09-08 02:57:19,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:19,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:19,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:19,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:19,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-08 02:57:19,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:19,980 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-08 02:57:19,990 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:57:20,108 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-08 02:57:20,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:20,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 02:57:20,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:20,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-08 02:57:20,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:20,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-08 02:57:20,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 02:57:20,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 02:57:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 02:57:20,194 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 41 states. [2019-09-08 02:57:20,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:20,615 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2019-09-08 02:57:20,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 02:57:20,615 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 277 [2019-09-08 02:57:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:20,618 INFO L225 Difference]: With dead ends: 293 [2019-09-08 02:57:20,618 INFO L226 Difference]: Without dead ends: 291 [2019-09-08 02:57:20,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:57:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-08 02:57:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2019-09-08 02:57:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-08 02:57:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2019-09-08 02:57:20,632 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 277 [2019-09-08 02:57:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:20,632 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2019-09-08 02:57:20,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 02:57:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2019-09-08 02:57:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 02:57:20,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:20,634 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:20,634 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 101011224, now seen corresponding path program 67 times [2019-09-08 02:57:20,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:20,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:20,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-08 02:57:22,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:22,102 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-08 02:57:22,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:57:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:22,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 02:57:22,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-08 02:57:22,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:22,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-08 02:57:22,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 02:57:22,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 02:57:22,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 02:57:22,249 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2019-09-08 02:57:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:24,599 INFO L93 Difference]: Finished difference Result 401 states and 437 transitions. [2019-09-08 02:57:24,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 02:57:24,599 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2019-09-08 02:57:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:24,600 INFO L225 Difference]: With dead ends: 401 [2019-09-08 02:57:24,600 INFO L226 Difference]: Without dead ends: 288 [2019-09-08 02:57:24,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2737, Invalid=9035, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 02:57:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-08 02:57:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-08 02:57:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-08 02:57:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2019-09-08 02:57:24,610 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 284 [2019-09-08 02:57:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:24,611 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2019-09-08 02:57:24,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 02:57:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2019-09-08 02:57:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-08 02:57:24,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:24,613 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:24,613 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1424604759, now seen corresponding path program 68 times [2019-09-08 02:57:24,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:24,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:24,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:57:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-08 02:57:25,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:25,236 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-08 02:57:25,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:57:25,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:57:25,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:25,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 02:57:25,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:25,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-08 02:57:25,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:25,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2019-09-08 02:57:25,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 02:57:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 02:57:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 02:57:25,439 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 42 states. [2019-09-08 02:57:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:25,871 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2019-09-08 02:57:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 02:57:25,872 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 285 [2019-09-08 02:57:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:25,874 INFO L225 Difference]: With dead ends: 301 [2019-09-08 02:57:25,874 INFO L226 Difference]: Without dead ends: 299 [2019-09-08 02:57:25,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:57:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-08 02:57:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2019-09-08 02:57:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-08 02:57:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-09-08 02:57:25,887 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2019-09-08 02:57:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:25,888 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-09-08 02:57:25,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 02:57:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-09-08 02:57:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 02:57:25,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:25,890 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:25,890 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:25,890 INFO L82 PathProgramCache]: Analyzing trace with hash 53852986, now seen corresponding path program 69 times [2019-09-08 02:57:25,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:25,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:25,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:25,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:25,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-08 02:57:27,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:27,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 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-08 02:57:27,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:57:27,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-08 02:57:27,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:27,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 02:57:27,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-08 02:57:27,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:27,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-08 02:57:27,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 02:57:27,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 02:57:27,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 02:57:27,612 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2019-09-08 02:57:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:30,062 INFO L93 Difference]: Finished difference Result 412 states and 449 transitions. [2019-09-08 02:57:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 02:57:30,062 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2019-09-08 02:57:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:30,063 INFO L225 Difference]: With dead ends: 412 [2019-09-08 02:57:30,063 INFO L226 Difference]: Without dead ends: 296 [2019-09-08 02:57:30,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2887, Invalid=9545, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 02:57:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-08 02:57:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-08 02:57:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-08 02:57:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2019-09-08 02:57:30,077 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 292 [2019-09-08 02:57:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:30,077 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2019-09-08 02:57:30,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 02:57:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2019-09-08 02:57:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 02:57:30,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:30,079 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:30,079 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1140296907, now seen corresponding path program 70 times [2019-09-08 02:57:30,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:30,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:30,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-08 02:57:30,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:30,709 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-08 02:57:30,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:57:30,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:57:30,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:30,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 02:57:30,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:30,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-08 02:57:30,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:30,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-09-08 02:57:30,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 02:57:30,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 02:57:30,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 02:57:30,934 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 43 states. [2019-09-08 02:57:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:31,386 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2019-09-08 02:57:31,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 02:57:31,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 293 [2019-09-08 02:57:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:31,388 INFO L225 Difference]: With dead ends: 309 [2019-09-08 02:57:31,388 INFO L226 Difference]: Without dead ends: 307 [2019-09-08 02:57:31,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:57:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-08 02:57:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-08 02:57:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-08 02:57:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2019-09-08 02:57:31,404 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 293 [2019-09-08 02:57:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:31,404 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2019-09-08 02:57:31,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 02:57:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2019-09-08 02:57:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 02:57:31,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:31,406 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:31,406 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:31,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1623063080, now seen corresponding path program 71 times [2019-09-08 02:57:31,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:31,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-08 02:57:33,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:33,213 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-08 02:57:33,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:57:33,346 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-08 02:57:33,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:33,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 02:57:33,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-08 02:57:33,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:33,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-08 02:57:33,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 02:57:33,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 02:57:33,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 02:57:33,430 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2019-09-08 02:57:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:36,117 INFO L93 Difference]: Finished difference Result 423 states and 461 transitions. [2019-09-08 02:57:36,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 02:57:36,123 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2019-09-08 02:57:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:36,125 INFO L225 Difference]: With dead ends: 423 [2019-09-08 02:57:36,125 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 02:57:36,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3041, Invalid=10069, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 02:57:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 02:57:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-08 02:57:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-08 02:57:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2019-09-08 02:57:36,141 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 300 [2019-09-08 02:57:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:36,141 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2019-09-08 02:57:36,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 02:57:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2019-09-08 02:57:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 02:57:36,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:36,143 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:36,144 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1751496297, now seen corresponding path program 72 times [2019-09-08 02:57:36,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:36,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:36,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-08 02:57:36,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:36,835 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-08 02:57:36,845 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:57:36,970 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 02:57:36,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:36,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 02:57:36,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:36,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-08 02:57:37,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:37,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-08 02:57:37,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 02:57:37,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 02:57:37,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 02:57:37,069 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 44 states. [2019-09-08 02:57:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:37,480 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2019-09-08 02:57:37,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 02:57:37,481 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 301 [2019-09-08 02:57:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:37,483 INFO L225 Difference]: With dead ends: 317 [2019-09-08 02:57:37,483 INFO L226 Difference]: Without dead ends: 315 [2019-09-08 02:57:37,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:57:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-08 02:57:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-09-08 02:57:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-08 02:57:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2019-09-08 02:57:37,493 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 301 [2019-09-08 02:57:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:37,494 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2019-09-08 02:57:37,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 02:57:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2019-09-08 02:57:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 02:57:37,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:37,495 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:37,495 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:37,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1883074170, now seen corresponding path program 73 times [2019-09-08 02:57:37,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:37,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:37,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-08 02:57:39,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:39,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:57:39,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:57:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:39,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 02:57:39,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-08 02:57:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-08 02:57:39,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 02:57:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 02:57:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 02:57:39,350 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2019-09-08 02:57:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:42,019 INFO L93 Difference]: Finished difference Result 434 states and 473 transitions. [2019-09-08 02:57:42,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 02:57:42,019 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2019-09-08 02:57:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:42,020 INFO L225 Difference]: With dead ends: 434 [2019-09-08 02:57:42,020 INFO L226 Difference]: Without dead ends: 312 [2019-09-08 02:57:42,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3199, Invalid=10607, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 02:57:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-08 02:57:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-09-08 02:57:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-08 02:57:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2019-09-08 02:57:42,034 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 308 [2019-09-08 02:57:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:42,034 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2019-09-08 02:57:42,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 02:57:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2019-09-08 02:57:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 02:57:42,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:42,036 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:42,036 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1836318219, now seen corresponding path program 74 times [2019-09-08 02:57:42,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:42,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:42,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:42,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:57:42,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-08 02:57:42,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:42,771 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-08 02:57:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:57:42,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:57:42,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:42,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 02:57:42,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:42,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-08 02:57:42,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:42,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-09-08 02:57:42,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 02:57:42,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 02:57:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 02:57:42,978 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 45 states. [2019-09-08 02:57:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:43,389 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2019-09-08 02:57:43,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 02:57:43,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 309 [2019-09-08 02:57:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:43,391 INFO L225 Difference]: With dead ends: 325 [2019-09-08 02:57:43,391 INFO L226 Difference]: Without dead ends: 323 [2019-09-08 02:57:43,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:57:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-08 02:57:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-09-08 02:57:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 02:57:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2019-09-08 02:57:43,403 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 309 [2019-09-08 02:57:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:43,404 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2019-09-08 02:57:43,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 02:57:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2019-09-08 02:57:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 02:57:43,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:43,406 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:43,406 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1868541080, now seen corresponding path program 75 times [2019-09-08 02:57:43,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:43,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:43,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-08 02:57:45,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:45,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 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-08 02:57:45,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:57:45,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-08 02:57:45,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:45,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 02:57:45,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-08 02:57:45,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-08 02:57:45,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 02:57:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 02:57:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 02:57:45,454 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2019-09-08 02:57:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:48,352 INFO L93 Difference]: Finished difference Result 445 states and 485 transitions. [2019-09-08 02:57:48,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 02:57:48,353 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2019-09-08 02:57:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:48,354 INFO L225 Difference]: With dead ends: 445 [2019-09-08 02:57:48,354 INFO L226 Difference]: Without dead ends: 320 [2019-09-08 02:57:48,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3361, Invalid=11159, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 02:57:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-08 02:57:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-08 02:57:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-08 02:57:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2019-09-08 02:57:48,371 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 316 [2019-09-08 02:57:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:48,372 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2019-09-08 02:57:48,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 02:57:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2019-09-08 02:57:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 02:57:48,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:48,374 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:48,375 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash 190454569, now seen corresponding path program 76 times [2019-09-08 02:57:48,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:48,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-08 02:57:49,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:49,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:57:49,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:57:49,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:57:49,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:49,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 02:57:49,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:49,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-08 02:57:49,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:49,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2019-09-08 02:57:49,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 02:57:49,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 02:57:49,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 02:57:49,322 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 46 states. [2019-09-08 02:57:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:49,825 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2019-09-08 02:57:49,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 02:57:49,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 317 [2019-09-08 02:57:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:49,828 INFO L225 Difference]: With dead ends: 333 [2019-09-08 02:57:49,828 INFO L226 Difference]: Without dead ends: 331 [2019-09-08 02:57:49,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:57:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-08 02:57:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-09-08 02:57:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-08 02:57:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2019-09-08 02:57:49,840 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 317 [2019-09-08 02:57:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:49,840 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2019-09-08 02:57:49,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 02:57:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2019-09-08 02:57:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 02:57:49,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:49,842 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:49,842 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash 825373114, now seen corresponding path program 77 times [2019-09-08 02:57:49,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:49,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:49,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:49,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-08 02:57:51,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:51,667 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-08 02:57:51,677 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:57:51,807 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-08 02:57:51,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:51,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 02:57:51,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-08 02:57:51,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:51,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-08 02:57:51,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 02:57:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 02:57:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 02:57:51,889 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2019-09-08 02:57:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:53,938 INFO L93 Difference]: Finished difference Result 456 states and 497 transitions. [2019-09-08 02:57:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 02:57:53,939 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2019-09-08 02:57:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:53,941 INFO L225 Difference]: With dead ends: 456 [2019-09-08 02:57:53,941 INFO L226 Difference]: Without dead ends: 328 [2019-09-08 02:57:53,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3527, Invalid=11725, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 02:57:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-08 02:57:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-09-08 02:57:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 02:57:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2019-09-08 02:57:53,960 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 324 [2019-09-08 02:57:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:53,960 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2019-09-08 02:57:53,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 02:57:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2019-09-08 02:57:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 02:57:53,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:53,962 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:53,963 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1784578229, now seen corresponding path program 78 times [2019-09-08 02:57:53,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:53,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:53,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-08 02:57:54,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:54,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 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-08 02:57:54,767 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:57:54,907 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-09-08 02:57:54,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:57:54,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 02:57:54,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:54,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:57:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-08 02:57:55,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:55,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-08 02:57:55,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 02:57:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 02:57:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:57:55,012 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 47 states. [2019-09-08 02:57:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:57:55,407 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2019-09-08 02:57:55,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 02:57:55,407 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 325 [2019-09-08 02:57:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:57:55,410 INFO L225 Difference]: With dead ends: 341 [2019-09-08 02:57:55,410 INFO L226 Difference]: Without dead ends: 339 [2019-09-08 02:57:55,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:57:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-08 02:57:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2019-09-08 02:57:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-08 02:57:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2019-09-08 02:57:55,422 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 325 [2019-09-08 02:57:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:57:55,422 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2019-09-08 02:57:55,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 02:57:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2019-09-08 02:57:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 02:57:55,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:57:55,425 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:57:55,425 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:57:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:57:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1703263400, now seen corresponding path program 79 times [2019-09-08 02:57:55,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:57:55,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:57:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:55,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:57:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:57:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-08 02:57:57,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:57:57,492 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-08 02:57:57,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:57:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:57:57,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 02:57:57,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:57:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-08 02:57:57,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:57:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-08 02:57:57,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 02:57:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 02:57:57,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 02:57:57,702 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2019-09-08 02:58:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:00,363 INFO L93 Difference]: Finished difference Result 467 states and 509 transitions. [2019-09-08 02:58:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 02:58:00,363 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2019-09-08 02:58:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:00,365 INFO L225 Difference]: With dead ends: 467 [2019-09-08 02:58:00,365 INFO L226 Difference]: Without dead ends: 336 [2019-09-08 02:58:00,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3697, Invalid=12305, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 02:58:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-08 02:58:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-08 02:58:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-08 02:58:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2019-09-08 02:58:00,376 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 332 [2019-09-08 02:58:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:00,376 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2019-09-08 02:58:00,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 02:58:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2019-09-08 02:58:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 02:58:00,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:00,378 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:00,378 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1341165591, now seen corresponding path program 80 times [2019-09-08 02:58:00,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:58:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-08 02:58:01,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:01,124 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-08 02:58:01,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:58:01,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:58:01,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:01,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 02:58:01,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:01,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-08 02:58:01,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:01,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2019-09-08 02:58:01,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 02:58:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 02:58:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:58:01,349 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 48 states. [2019-09-08 02:58:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:01,832 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2019-09-08 02:58:01,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 02:58:01,844 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 333 [2019-09-08 02:58:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:01,846 INFO L225 Difference]: With dead ends: 349 [2019-09-08 02:58:01,846 INFO L226 Difference]: Without dead ends: 347 [2019-09-08 02:58:01,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:58:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-08 02:58:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-08 02:58:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 02:58:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2019-09-08 02:58:01,856 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2019-09-08 02:58:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:01,857 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2019-09-08 02:58:01,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 02:58:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2019-09-08 02:58:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 02:58:01,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:01,858 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:01,858 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628166, now seen corresponding path program 81 times [2019-09-08 02:58:01,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:01,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-08 02:58:03,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:03,858 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-08 02:58:03,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:58:04,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-08 02:58:04,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:04,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 02:58:04,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-08 02:58:04,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:04,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-08 02:58:04,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 02:58:04,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 02:58:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 02:58:04,158 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2019-09-08 02:58:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:06,658 INFO L93 Difference]: Finished difference Result 478 states and 521 transitions. [2019-09-08 02:58:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 02:58:06,658 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2019-09-08 02:58:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:06,661 INFO L225 Difference]: With dead ends: 478 [2019-09-08 02:58:06,661 INFO L226 Difference]: Without dead ends: 344 [2019-09-08 02:58:06,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3871, Invalid=12899, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 02:58:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-08 02:58:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-09-08 02:58:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-08 02:58:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-09-08 02:58:06,680 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 340 [2019-09-08 02:58:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:06,681 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-09-08 02:58:06,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 02:58:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-09-08 02:58:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 02:58:06,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:06,683 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:06,683 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:06,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:06,684 INFO L82 PathProgramCache]: Analyzing trace with hash 14946443, now seen corresponding path program 82 times [2019-09-08 02:58:06,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:06,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:06,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:06,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:06,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-08 02:58:07,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:07,554 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-08 02:58:07,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:58:07,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:58:07,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:07,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 02:58:07,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-08 02:58:07,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:07,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-09-08 02:58:07,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 02:58:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 02:58:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 02:58:07,791 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 49 states. [2019-09-08 02:58:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:08,380 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2019-09-08 02:58:08,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 02:58:08,380 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 341 [2019-09-08 02:58:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:08,382 INFO L225 Difference]: With dead ends: 357 [2019-09-08 02:58:08,382 INFO L226 Difference]: Without dead ends: 355 [2019-09-08 02:58:08,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:58:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-08 02:58:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2019-09-08 02:58:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-08 02:58:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2019-09-08 02:58:08,396 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 341 [2019-09-08 02:58:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:08,396 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2019-09-08 02:58:08,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 02:58:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2019-09-08 02:58:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-08 02:58:08,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:08,398 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:08,398 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -475149800, now seen corresponding path program 83 times [2019-09-08 02:58:08,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:08,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:08,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:08,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-08 02:58:10,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:10,544 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-08 02:58:10,553 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:58:10,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-08 02:58:10,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:10,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 02:58:10,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-08 02:58:10,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:10,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-08 02:58:10,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 02:58:10,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 02:58:10,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1981, Invalid=5851, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 02:58:10,837 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2019-09-08 02:58:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:15,576 INFO L93 Difference]: Finished difference Result 489 states and 533 transitions. [2019-09-08 02:58:15,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 02:58:15,577 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2019-09-08 02:58:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:15,578 INFO L225 Difference]: With dead ends: 489 [2019-09-08 02:58:15,578 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 02:58:15,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2751 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4049, Invalid=13507, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 02:58:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 02:58:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-08 02:58:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 02:58:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2019-09-08 02:58:15,593 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 348 [2019-09-08 02:58:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:15,593 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2019-09-08 02:58:15,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 02:58:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2019-09-08 02:58:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-08 02:58:15,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:15,596 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:15,596 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 295810217, now seen corresponding path program 84 times [2019-09-08 02:58:15,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:15,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-08 02:58:16,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:16,483 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-08 02:58:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:58:16,709 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-08 02:58:16,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:16,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 02:58:16,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:16,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-08 02:58:16,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:16,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-08 02:58:16,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 02:58:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 02:58:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:58:16,895 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 50 states. [2019-09-08 02:58:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:17,436 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2019-09-08 02:58:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 02:58:17,437 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 349 [2019-09-08 02:58:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:17,439 INFO L225 Difference]: With dead ends: 365 [2019-09-08 02:58:17,440 INFO L226 Difference]: Without dead ends: 363 [2019-09-08 02:58:17,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:58:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-08 02:58:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2019-09-08 02:58:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-08 02:58:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2019-09-08 02:58:17,454 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2019-09-08 02:58:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:17,454 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2019-09-08 02:58:17,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 02:58:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2019-09-08 02:58:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-08 02:58:17,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:17,456 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:17,456 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1634920506, now seen corresponding path program 85 times [2019-09-08 02:58:17,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:17,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-08 02:58:19,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:19,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 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-08 02:58:19,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:58:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:19,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 02:58:19,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-08 02:58:19,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:19,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-08 02:58:19,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 02:58:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 02:58:19,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 02:58:19,886 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2019-09-08 02:58:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:23,453 INFO L93 Difference]: Finished difference Result 500 states and 545 transitions. [2019-09-08 02:58:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 02:58:23,454 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2019-09-08 02:58:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:23,455 INFO L225 Difference]: With dead ends: 500 [2019-09-08 02:58:23,456 INFO L226 Difference]: Without dead ends: 360 [2019-09-08 02:58:23,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4231, Invalid=14129, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 02:58:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-08 02:58:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-09-08 02:58:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-08 02:58:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2019-09-08 02:58:23,476 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 356 [2019-09-08 02:58:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:23,477 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2019-09-08 02:58:23,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 02:58:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2019-09-08 02:58:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 02:58:23,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:23,479 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:23,480 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1956622795, now seen corresponding path program 86 times [2019-09-08 02:58:23,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:23,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:23,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:23,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:58:23,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-08 02:58:24,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:24,617 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-08 02:58:24,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:58:24,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:58:24,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:24,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 02:58:24,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:24,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-08 02:58:24,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:24,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-09-08 02:58:24,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 02:58:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 02:58:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 02:58:24,875 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 51 states. [2019-09-08 02:58:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:25,299 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2019-09-08 02:58:25,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 02:58:25,299 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 357 [2019-09-08 02:58:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:25,301 INFO L225 Difference]: With dead ends: 373 [2019-09-08 02:58:25,302 INFO L226 Difference]: Without dead ends: 371 [2019-09-08 02:58:25,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 02:58:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-08 02:58:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2019-09-08 02:58:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-08 02:58:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2019-09-08 02:58:25,316 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 357 [2019-09-08 02:58:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:25,317 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2019-09-08 02:58:25,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 02:58:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2019-09-08 02:58:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 02:58:25,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:25,318 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:25,318 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1830174936, now seen corresponding path program 87 times [2019-09-08 02:58:25,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:25,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:25,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-08 02:58:27,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:27,683 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-08 02:58:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:58:27,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-08 02:58:27,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:27,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 02:58:27,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-08 02:58:27,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:27,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-08 02:58:27,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-08 02:58:27,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-08 02:58:27,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2163, Invalid=6393, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 02:58:27,975 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 93 states. [2019-09-08 02:58:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:31,614 INFO L93 Difference]: Finished difference Result 511 states and 557 transitions. [2019-09-08 02:58:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 02:58:31,615 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2019-09-08 02:58:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:31,616 INFO L225 Difference]: With dead ends: 511 [2019-09-08 02:58:31,616 INFO L226 Difference]: Without dead ends: 368 [2019-09-08 02:58:31,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3014 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4417, Invalid=14765, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 02:58:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-08 02:58:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-09-08 02:58:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-08 02:58:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2019-09-08 02:58:31,636 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 364 [2019-09-08 02:58:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:31,636 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2019-09-08 02:58:31,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-08 02:58:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2019-09-08 02:58:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-08 02:58:31,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:31,639 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:31,639 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1244457321, now seen corresponding path program 88 times [2019-09-08 02:58:31,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:31,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:31,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:31,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:31,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-08 02:58:32,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:32,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 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-08 02:58:32,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:58:32,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:58:32,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:32,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 02:58:32,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:32,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-08 02:58:32,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:32,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 52 [2019-09-08 02:58:32,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 02:58:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 02:58:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 02:58:32,933 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 52 states. [2019-09-08 02:58:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:33,349 INFO L93 Difference]: Finished difference Result 381 states and 383 transitions. [2019-09-08 02:58:33,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 02:58:33,350 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 365 [2019-09-08 02:58:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:33,352 INFO L225 Difference]: With dead ends: 381 [2019-09-08 02:58:33,352 INFO L226 Difference]: Without dead ends: 379 [2019-09-08 02:58:33,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:58:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-08 02:58:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2019-09-08 02:58:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 02:58:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2019-09-08 02:58:33,373 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 365 [2019-09-08 02:58:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:33,373 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2019-09-08 02:58:33,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 02:58:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2019-09-08 02:58:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 02:58:33,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:33,376 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:33,376 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 747035514, now seen corresponding path program 89 times [2019-09-08 02:58:33,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:33,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-08 02:58:36,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:36,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:58:36,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:58:36,255 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-08 02:58:36,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:36,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 02:58:36,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-08 02:58:36,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:36,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-08 02:58:36,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-08 02:58:36,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-08 02:58:36,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 02:58:36,357 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 95 states. [2019-09-08 02:58:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:39,371 INFO L93 Difference]: Finished difference Result 522 states and 569 transitions. [2019-09-08 02:58:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 02:58:39,371 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2019-09-08 02:58:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:39,373 INFO L225 Difference]: With dead ends: 522 [2019-09-08 02:58:39,373 INFO L226 Difference]: Without dead ends: 376 [2019-09-08 02:58:39,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4607, Invalid=15415, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 02:58:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-08 02:58:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-09-08 02:58:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-08 02:58:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-09-08 02:58:39,391 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 372 [2019-09-08 02:58:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:39,391 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2019-09-08 02:58:39,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-08 02:58:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2019-09-08 02:58:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 02:58:39,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:39,393 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:39,393 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:39,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:39,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2000184075, now seen corresponding path program 90 times [2019-09-08 02:58:39,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:39,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:39,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:39,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:39,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-08 02:58:40,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:40,371 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-08 02:58:40,381 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:58:40,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-08 02:58:40,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:40,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 02:58:40,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:40,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-08 02:58:40,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:40,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-08 02:58:40,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 02:58:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 02:58:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 02:58:40,702 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 53 states. [2019-09-08 02:58:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:41,281 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2019-09-08 02:58:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 02:58:41,282 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 373 [2019-09-08 02:58:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:41,284 INFO L225 Difference]: With dead ends: 389 [2019-09-08 02:58:41,284 INFO L226 Difference]: Without dead ends: 387 [2019-09-08 02:58:41,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 02:58:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-08 02:58:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-08 02:58:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-08 02:58:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2019-09-08 02:58:41,299 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 373 [2019-09-08 02:58:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:41,299 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2019-09-08 02:58:41,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 02:58:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2019-09-08 02:58:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-08 02:58:41,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:41,301 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:41,301 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2010097560, now seen corresponding path program 91 times [2019-09-08 02:58:41,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:41,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:41,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-08 02:58:43,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:43,891 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-08 02:58:43,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:58:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:44,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 02:58:44,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-08 02:58:44,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:44,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-08 02:58:44,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-08 02:58:44,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-08 02:58:44,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2353, Invalid=6959, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 02:58:44,104 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 97 states. [2019-09-08 02:58:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:47,645 INFO L93 Difference]: Finished difference Result 533 states and 581 transitions. [2019-09-08 02:58:47,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-08 02:58:47,645 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2019-09-08 02:58:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:47,647 INFO L225 Difference]: With dead ends: 533 [2019-09-08 02:58:47,647 INFO L226 Difference]: Without dead ends: 384 [2019-09-08 02:58:47,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4801, Invalid=16079, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 02:58:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-08 02:58:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-09-08 02:58:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-08 02:58:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2019-09-08 02:58:47,666 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 380 [2019-09-08 02:58:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:47,666 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2019-09-08 02:58:47,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-08 02:58:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2019-09-08 02:58:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-08 02:58:47,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:47,669 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:47,669 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1832055255, now seen corresponding path program 92 times [2019-09-08 02:58:47,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:47,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:47,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:58:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-08 02:58:48,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:48,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 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-08 02:58:48,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:58:48,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:58:48,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:48,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 02:58:48,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:48,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-08 02:58:48,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:48,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 54 [2019-09-08 02:58:48,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 02:58:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 02:58:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 02:58:48,939 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 54 states. [2019-09-08 02:58:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:49,566 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2019-09-08 02:58:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 02:58:49,566 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 381 [2019-09-08 02:58:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:49,568 INFO L225 Difference]: With dead ends: 397 [2019-09-08 02:58:49,568 INFO L226 Difference]: Without dead ends: 395 [2019-09-08 02:58:49,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:58:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-08 02:58:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-08 02:58:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-08 02:58:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2019-09-08 02:58:49,590 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 381 [2019-09-08 02:58:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:49,590 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2019-09-08 02:58:49,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 02:58:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2019-09-08 02:58:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 02:58:49,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:49,593 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:49,593 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2095587654, now seen corresponding path program 93 times [2019-09-08 02:58:49,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:49,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:49,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-08 02:58:52,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:52,271 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-08 02:58:52,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:58:52,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-08 02:58:52,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:52,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 02:58:52,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-08 02:58:52,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-08 02:58:52,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-08 02:58:52,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-08 02:58:52,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 02:58:52,664 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 99 states. [2019-09-08 02:58:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:55,797 INFO L93 Difference]: Finished difference Result 544 states and 593 transitions. [2019-09-08 02:58:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 02:58:55,798 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2019-09-08 02:58:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:55,800 INFO L225 Difference]: With dead ends: 544 [2019-09-08 02:58:55,800 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 02:58:55,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4999, Invalid=16757, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 02:58:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 02:58:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2019-09-08 02:58:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-08 02:58:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2019-09-08 02:58:55,820 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 388 [2019-09-08 02:58:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:55,820 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2019-09-08 02:58:55,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-08 02:58:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2019-09-08 02:58:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 02:58:55,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:55,822 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:55,822 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:55,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1877859253, now seen corresponding path program 94 times [2019-09-08 02:58:55,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:55,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:58:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-08 02:58:56,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:58:56,872 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-08 02:58:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:58:57,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:58:57,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:58:57,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-08 02:58:57,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:58:57,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:58:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-08 02:58:57,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:58:57,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 55 [2019-09-08 02:58:57,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 02:58:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 02:58:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 02:58:57,142 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 55 states. [2019-09-08 02:58:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:58:57,782 INFO L93 Difference]: Finished difference Result 405 states and 407 transitions. [2019-09-08 02:58:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 02:58:57,783 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 389 [2019-09-08 02:58:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:58:57,785 INFO L225 Difference]: With dead ends: 405 [2019-09-08 02:58:57,785 INFO L226 Difference]: Without dead ends: 403 [2019-09-08 02:58:57,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:58:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-08 02:58:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2019-09-08 02:58:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-08 02:58:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2019-09-08 02:58:57,802 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 389 [2019-09-08 02:58:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:58:57,802 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2019-09-08 02:58:57,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 02:58:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2019-09-08 02:58:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 02:58:57,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:58:57,805 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:58:57,805 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:58:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:58:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 603323992, now seen corresponding path program 95 times [2019-09-08 02:58:57,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:58:57,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:58:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:57,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:58:57,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:58:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-08 02:59:00,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:00,527 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-08 02:59:00,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:59:00,733 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-09-08 02:59:00,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:00,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 02:59:00,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-08 02:59:00,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:00,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-08 02:59:00,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-08 02:59:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-08 02:59:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2551, Invalid=7549, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 02:59:00,828 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 101 states. [2019-09-08 02:59:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:05,276 INFO L93 Difference]: Finished difference Result 555 states and 605 transitions. [2019-09-08 02:59:05,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 02:59:05,277 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 396 [2019-09-08 02:59:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:05,279 INFO L225 Difference]: With dead ends: 555 [2019-09-08 02:59:05,279 INFO L226 Difference]: Without dead ends: 400 [2019-09-08 02:59:05,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3576 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5201, Invalid=17449, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 02:59:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-08 02:59:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-08 02:59:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 02:59:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2019-09-08 02:59:05,301 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 396 [2019-09-08 02:59:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:05,301 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2019-09-08 02:59:05,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-08 02:59:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2019-09-08 02:59:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-08 02:59:05,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:05,303 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:05,303 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash 60695273, now seen corresponding path program 96 times [2019-09-08 02:59:05,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:05,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:05,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-08 02:59:06,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:06,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 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-08 02:59:06,498 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:59:06,694 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-08 02:59:06,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:06,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-08 02:59:06,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:06,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:59:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-08 02:59:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:06,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-08 02:59:06,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 02:59:06,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 02:59:06,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 02:59:06,832 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 56 states. [2019-09-08 02:59:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:07,447 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2019-09-08 02:59:07,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 02:59:07,447 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 397 [2019-09-08 02:59:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:07,449 INFO L225 Difference]: With dead ends: 413 [2019-09-08 02:59:07,449 INFO L226 Difference]: Without dead ends: 411 [2019-09-08 02:59:07,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:59:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-08 02:59:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-09-08 02:59:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-08 02:59:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2019-09-08 02:59:07,470 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2019-09-08 02:59:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:07,470 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2019-09-08 02:59:07,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 02:59:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2019-09-08 02:59:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 02:59:07,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:07,473 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:07,473 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 898232826, now seen corresponding path program 97 times [2019-09-08 02:59:07,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:07,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:07,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:07,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:07,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-08 02:59:10,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:10,285 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-08 02:59:10,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:59:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:10,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-08 02:59:10,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-08 02:59:10,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:10,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-08 02:59:10,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-08 02:59:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-08 02:59:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 02:59:10,537 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 103 states. [2019-09-08 02:59:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:15,149 INFO L93 Difference]: Finished difference Result 566 states and 617 transitions. [2019-09-08 02:59:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-08 02:59:15,150 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 404 [2019-09-08 02:59:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:15,151 INFO L225 Difference]: With dead ends: 566 [2019-09-08 02:59:15,152 INFO L226 Difference]: Without dead ends: 408 [2019-09-08 02:59:15,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5407, Invalid=18155, Unknown=0, NotChecked=0, Total=23562 [2019-09-08 02:59:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-08 02:59:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-08 02:59:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-08 02:59:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2019-09-08 02:59:15,173 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 404 [2019-09-08 02:59:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:15,173 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2019-09-08 02:59:15,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-08 02:59:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2019-09-08 02:59:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-08 02:59:15,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:15,176 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:15,176 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:15,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:15,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2020543093, now seen corresponding path program 98 times [2019-09-08 02:59:15,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:15,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:59:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-08 02:59:16,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:16,279 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-08 02:59:16,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:59:16,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:59:16,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:16,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-08 02:59:16,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:16,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:59:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-08 02:59:16,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:16,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-09-08 02:59:16,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 02:59:16,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 02:59:16,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:59:16,589 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 57 states. [2019-09-08 02:59:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:17,213 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2019-09-08 02:59:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 02:59:17,213 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 405 [2019-09-08 02:59:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:17,215 INFO L225 Difference]: With dead ends: 421 [2019-09-08 02:59:17,215 INFO L226 Difference]: Without dead ends: 419 [2019-09-08 02:59:17,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1394, Invalid=1912, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:59:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-08 02:59:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2019-09-08 02:59:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-08 02:59:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2019-09-08 02:59:17,231 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 405 [2019-09-08 02:59:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:17,231 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2019-09-08 02:59:17,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 02:59:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2019-09-08 02:59:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 02:59:17,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:17,234 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:17,234 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 816137496, now seen corresponding path program 99 times [2019-09-08 02:59:17,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:17,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:17,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:17,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:17,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-08 02:59:20,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:20,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 02:59:20,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:59:20,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-08 02:59:20,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:20,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-08 02:59:20,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-08 02:59:20,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:20,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-08 02:59:20,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-08 02:59:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-08 02:59:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2757, Invalid=8163, Unknown=0, NotChecked=0, Total=10920 [2019-09-08 02:59:20,578 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 105 states. [2019-09-08 02:59:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:25,321 INFO L93 Difference]: Finished difference Result 577 states and 629 transitions. [2019-09-08 02:59:25,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-08 02:59:25,322 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 412 [2019-09-08 02:59:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:25,324 INFO L225 Difference]: With dead ends: 577 [2019-09-08 02:59:25,324 INFO L226 Difference]: Without dead ends: 416 [2019-09-08 02:59:25,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3875 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5617, Invalid=18875, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 02:59:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-08 02:59:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-09-08 02:59:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-08 02:59:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2019-09-08 02:59:25,344 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 412 [2019-09-08 02:59:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:25,345 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2019-09-08 02:59:25,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-08 02:59:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2019-09-08 02:59:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 02:59:25,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:25,347 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:25,347 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1404839849, now seen corresponding path program 100 times [2019-09-08 02:59:25,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:25,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:25,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:25,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:25,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-08 02:59:26,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:26,526 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-08 02:59:26,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:59:26,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:59:26,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:26,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-08 02:59:26,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:59:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-08 02:59:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 58 [2019-09-08 02:59:26,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 02:59:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 02:59:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 02:59:26,827 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 58 states. [2019-09-08 02:59:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:27,514 INFO L93 Difference]: Finished difference Result 429 states and 431 transitions. [2019-09-08 02:59:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 02:59:27,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 413 [2019-09-08 02:59:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:27,517 INFO L225 Difference]: With dead ends: 429 [2019-09-08 02:59:27,518 INFO L226 Difference]: Without dead ends: 427 [2019-09-08 02:59:27,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 02:59:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-08 02:59:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-08 02:59:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 02:59:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2019-09-08 02:59:27,541 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 413 [2019-09-08 02:59:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:27,542 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2019-09-08 02:59:27,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 02:59:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2019-09-08 02:59:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-08 02:59:27,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:27,545 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:27,545 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1790896838, now seen corresponding path program 101 times [2019-09-08 02:59:27,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:27,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:27,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:27,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:27,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-08 02:59:30,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:30,623 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-08 02:59:30,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:59:30,850 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2019-09-08 02:59:30,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:30,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-08 02:59:30,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-08 02:59:30,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:30,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-08 02:59:30,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-08 02:59:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-08 02:59:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 02:59:30,980 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 107 states. [2019-09-08 02:59:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:33,892 INFO L93 Difference]: Finished difference Result 588 states and 641 transitions. [2019-09-08 02:59:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-08 02:59:33,893 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 420 [2019-09-08 02:59:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:33,894 INFO L225 Difference]: With dead ends: 588 [2019-09-08 02:59:33,894 INFO L226 Difference]: Without dead ends: 424 [2019-09-08 02:59:33,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4029 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5831, Invalid=19609, Unknown=0, NotChecked=0, Total=25440 [2019-09-08 02:59:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-08 02:59:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-09-08 02:59:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-08 02:59:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2019-09-08 02:59:33,918 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 420 [2019-09-08 02:59:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:33,918 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2019-09-08 02:59:33,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-08 02:59:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2019-09-08 02:59:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 02:59:33,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:33,920 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:33,920 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1491544373, now seen corresponding path program 102 times [2019-09-08 02:59:33,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:33,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:33,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-08 02:59:35,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:35,122 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-08 02:59:35,132 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 02:59:35,354 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-09-08 02:59:35,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:35,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-08 02:59:35,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:59:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-08 02:59:35,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:35,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-08 02:59:35,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 02:59:35,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 02:59:35,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 02:59:35,512 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 59 states. [2019-09-08 02:59:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:36,220 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2019-09-08 02:59:36,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 02:59:36,221 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 421 [2019-09-08 02:59:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:36,223 INFO L225 Difference]: With dead ends: 437 [2019-09-08 02:59:36,223 INFO L226 Difference]: Without dead ends: 435 [2019-09-08 02:59:36,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:59:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-08 02:59:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-08 02:59:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-08 02:59:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2019-09-08 02:59:36,240 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 421 [2019-09-08 02:59:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:36,240 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2019-09-08 02:59:36,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 02:59:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2019-09-08 02:59:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-08 02:59:36,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:36,242 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:36,242 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1141277736, now seen corresponding path program 103 times [2019-09-08 02:59:36,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:36,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-08 02:59:39,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:39,428 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-08 02:59:39,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:59:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:39,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-08 02:59:39,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-08 02:59:39,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:39,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-08 02:59:39,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-08 02:59:39,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-08 02:59:39,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=8801, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 02:59:39,725 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 109 states. [2019-09-08 02:59:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:42,922 INFO L93 Difference]: Finished difference Result 599 states and 653 transitions. [2019-09-08 02:59:42,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 02:59:42,922 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 428 [2019-09-08 02:59:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:42,924 INFO L225 Difference]: With dead ends: 599 [2019-09-08 02:59:42,924 INFO L226 Difference]: Without dead ends: 432 [2019-09-08 02:59:42,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6049, Invalid=20357, Unknown=0, NotChecked=0, Total=26406 [2019-09-08 02:59:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-08 02:59:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-09-08 02:59:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-08 02:59:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2019-09-08 02:59:42,942 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 428 [2019-09-08 02:59:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:42,942 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2019-09-08 02:59:42,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-08 02:59:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2019-09-08 02:59:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-08 02:59:42,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:42,944 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:42,944 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1723655063, now seen corresponding path program 104 times [2019-09-08 02:59:42,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:42,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:42,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:59:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-08 02:59:44,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:44,337 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-08 02:59:44,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:59:44,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:59:44,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:44,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-08 02:59:44,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:44,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:59:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-08 02:59:44,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:44,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 60 [2019-09-08 02:59:44,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 02:59:44,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 02:59:44,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 02:59:44,659 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 60 states. [2019-09-08 02:59:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:45,255 INFO L93 Difference]: Finished difference Result 445 states and 447 transitions. [2019-09-08 02:59:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 02:59:45,256 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 429 [2019-09-08 02:59:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:45,257 INFO L225 Difference]: With dead ends: 445 [2019-09-08 02:59:45,257 INFO L226 Difference]: Without dead ends: 443 [2019-09-08 02:59:45,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 02:59:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-08 02:59:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-08 02:59:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-08 02:59:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2019-09-08 02:59:45,274 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 429 [2019-09-08 02:59:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:45,274 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2019-09-08 02:59:45,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 02:59:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2019-09-08 02:59:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-08 02:59:45,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:45,276 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:45,276 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1264498566, now seen corresponding path program 105 times [2019-09-08 02:59:45,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:45,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:45,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-08 02:59:48,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:48,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 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-08 02:59:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:59:48,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-08 02:59:48,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:48,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-08 02:59:48,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-08 02:59:49,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:49,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-08 02:59:49,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-08 02:59:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-08 02:59:49,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 02:59:49,076 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 111 states. [2019-09-08 02:59:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:54,317 INFO L93 Difference]: Finished difference Result 610 states and 665 transitions. [2019-09-08 02:59:54,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-08 02:59:54,317 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 436 [2019-09-08 02:59:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:54,319 INFO L225 Difference]: With dead ends: 610 [2019-09-08 02:59:54,319 INFO L226 Difference]: Without dead ends: 440 [2019-09-08 02:59:54,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6271, Invalid=21119, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 02:59:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-08 02:59:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-09-08 02:59:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 02:59:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2019-09-08 02:59:54,343 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 436 [2019-09-08 02:59:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:54,343 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2019-09-08 02:59:54,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-08 02:59:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2019-09-08 02:59:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 02:59:54,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:54,346 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:54,346 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash -116537333, now seen corresponding path program 106 times [2019-09-08 02:59:54,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:54,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-08 02:59:55,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:55,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 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-08 02:59:55,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:59:55,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:59:55,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:59:55,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-08 02:59:55,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:59:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:59:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-08 02:59:55,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:59:55,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-09-08 02:59:55,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 02:59:55,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 02:59:55,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 02:59:55,929 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 61 states. [2019-09-08 02:59:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:59:56,556 INFO L93 Difference]: Finished difference Result 453 states and 455 transitions. [2019-09-08 02:59:56,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 02:59:56,556 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 437 [2019-09-08 02:59:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:59:56,558 INFO L225 Difference]: With dead ends: 453 [2019-09-08 02:59:56,558 INFO L226 Difference]: Without dead ends: 451 [2019-09-08 02:59:56,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 02:59:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-08 02:59:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2019-09-08 02:59:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-08 02:59:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2019-09-08 02:59:56,579 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 437 [2019-09-08 02:59:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:59:56,579 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2019-09-08 02:59:56,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 02:59:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2019-09-08 02:59:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-08 02:59:56,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:59:56,582 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:59:56,582 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:59:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:59:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash 51290776, now seen corresponding path program 107 times [2019-09-08 02:59:56,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:59:56,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:59:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:56,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:59:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:59:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:59:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-08 02:59:59,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:59:59,970 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-08 02:59:59,981 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:00:00,195 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-08 03:00:00,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:00,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-08 03:00:00,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-08 03:00:00,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:00,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-08 03:00:00,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-08 03:00:00,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-08 03:00:00,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3193, Invalid=9463, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 03:00:00,305 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 113 states. [2019-09-08 03:00:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:05,769 INFO L93 Difference]: Finished difference Result 621 states and 677 transitions. [2019-09-08 03:00:05,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-08 03:00:05,770 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 444 [2019-09-08 03:00:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:05,771 INFO L225 Difference]: With dead ends: 621 [2019-09-08 03:00:05,771 INFO L226 Difference]: Without dead ends: 448 [2019-09-08 03:00:05,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4509 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6497, Invalid=21895, Unknown=0, NotChecked=0, Total=28392 [2019-09-08 03:00:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-08 03:00:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-09-08 03:00:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-08 03:00:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2019-09-08 03:00:05,801 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 444 [2019-09-08 03:00:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:05,802 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2019-09-08 03:00:05,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-08 03:00:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2019-09-08 03:00:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-08 03:00:05,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:05,804 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:05,805 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash 156172585, now seen corresponding path program 108 times [2019-09-08 03:00:05,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:05,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:05,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-08 03:00:07,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:07,136 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-08 03:00:07,146 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:00:07,376 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-08 03:00:07,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:07,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-08 03:00:07,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:07,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:00:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-08 03:00:07,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:07,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 62 [2019-09-08 03:00:07,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 03:00:07,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 03:00:07,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 03:00:07,535 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 62 states. [2019-09-08 03:00:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:08,186 INFO L93 Difference]: Finished difference Result 461 states and 463 transitions. [2019-09-08 03:00:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 03:00:08,187 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 445 [2019-09-08 03:00:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:08,189 INFO L225 Difference]: With dead ends: 461 [2019-09-08 03:00:08,189 INFO L226 Difference]: Without dead ends: 459 [2019-09-08 03:00:08,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 03:00:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-08 03:00:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2019-09-08 03:00:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-08 03:00:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2019-09-08 03:00:08,208 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 445 [2019-09-08 03:00:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:08,208 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2019-09-08 03:00:08,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 03:00:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2019-09-08 03:00:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-08 03:00:08,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:08,210 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:08,210 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1492218950, now seen corresponding path program 109 times [2019-09-08 03:00:08,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:08,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-08 03:00:11,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:11,761 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-08 03:00:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:00:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:11,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-08 03:00:11,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-08 03:00:12,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:12,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-08 03:00:12,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-08 03:00:12,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-08 03:00:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 03:00:12,025 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 115 states. [2019-09-08 03:00:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:17,701 INFO L93 Difference]: Finished difference Result 632 states and 689 transitions. [2019-09-08 03:00:17,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-08 03:00:17,701 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 452 [2019-09-08 03:00:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:17,703 INFO L225 Difference]: With dead ends: 632 [2019-09-08 03:00:17,703 INFO L226 Difference]: Without dead ends: 456 [2019-09-08 03:00:17,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4675 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6727, Invalid=22685, Unknown=0, NotChecked=0, Total=29412 [2019-09-08 03:00:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-08 03:00:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-09-08 03:00:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-08 03:00:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2019-09-08 03:00:17,721 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 452 [2019-09-08 03:00:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:17,721 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2019-09-08 03:00:17,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-08 03:00:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2019-09-08 03:00:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 03:00:17,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:17,723 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:17,724 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1999386293, now seen corresponding path program 110 times [2019-09-08 03:00:17,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:17,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:17,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:00:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-08 03:00:19,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:19,102 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-08 03:00:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:00:19,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:00:19,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:19,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-08 03:00:19,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:19,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:00:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-08 03:00:19,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:19,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-09-08 03:00:19,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 03:00:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 03:00:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 03:00:19,620 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 63 states. [2019-09-08 03:00:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:20,370 INFO L93 Difference]: Finished difference Result 469 states and 471 transitions. [2019-09-08 03:00:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 03:00:20,371 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 453 [2019-09-08 03:00:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:20,373 INFO L225 Difference]: With dead ends: 469 [2019-09-08 03:00:20,373 INFO L226 Difference]: Without dead ends: 467 [2019-09-08 03:00:20,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1727, Invalid=2305, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 03:00:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-08 03:00:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-08 03:00:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-08 03:00:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2019-09-08 03:00:20,395 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 453 [2019-09-08 03:00:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:20,395 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2019-09-08 03:00:20,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 03:00:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2019-09-08 03:00:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-08 03:00:20,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:20,397 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:20,397 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash 570472792, now seen corresponding path program 111 times [2019-09-08 03:00:20,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:20,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:20,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-08 03:00:24,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:24,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 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-08 03:00:24,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:00:24,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-08 03:00:24,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:24,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-08 03:00:24,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-08 03:00:24,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:24,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-08 03:00:24,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-08 03:00:24,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-08 03:00:24,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3423, Invalid=10149, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 03:00:24,587 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 117 states. [2019-09-08 03:00:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:30,339 INFO L93 Difference]: Finished difference Result 643 states and 701 transitions. [2019-09-08 03:00:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-08 03:00:30,339 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 460 [2019-09-08 03:00:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:30,341 INFO L225 Difference]: With dead ends: 643 [2019-09-08 03:00:30,341 INFO L226 Difference]: Without dead ends: 464 [2019-09-08 03:00:30,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4844 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6961, Invalid=23489, Unknown=0, NotChecked=0, Total=30450 [2019-09-08 03:00:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-08 03:00:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-08 03:00:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 03:00:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-09-08 03:00:30,366 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 460 [2019-09-08 03:00:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:30,367 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-09-08 03:00:30,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-08 03:00:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-09-08 03:00:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-08 03:00:30,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:30,370 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:30,370 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1208232471, now seen corresponding path program 112 times [2019-09-08 03:00:30,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:30,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:30,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:30,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:30,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-08 03:00:31,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:31,773 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-08 03:00:31,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:00:31,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:00:31,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:31,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-08 03:00:31,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:31,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:00:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-08 03:00:32,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:32,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 64 [2019-09-08 03:00:32,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 03:00:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 03:00:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 03:00:32,124 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 64 states. [2019-09-08 03:00:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:32,882 INFO L93 Difference]: Finished difference Result 477 states and 479 transitions. [2019-09-08 03:00:32,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 03:00:32,883 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 461 [2019-09-08 03:00:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:32,885 INFO L225 Difference]: With dead ends: 477 [2019-09-08 03:00:32,885 INFO L226 Difference]: Without dead ends: 475 [2019-09-08 03:00:32,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 03:00:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-08 03:00:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-09-08 03:00:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-08 03:00:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2019-09-08 03:00:32,906 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 461 [2019-09-08 03:00:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:32,907 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2019-09-08 03:00:32,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 03:00:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2019-09-08 03:00:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 03:00:32,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:32,909 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:32,909 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1058218246, now seen corresponding path program 113 times [2019-09-08 03:00:32,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:32,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-08 03:00:36,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:36,694 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-08 03:00:36,704 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:00:36,945 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2019-09-08 03:00:36,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:36,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-08 03:00:36,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (114)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:00:37,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:37,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-08 03:00:37,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-08 03:00:37,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-08 03:00:37,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 03:00:37,067 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 119 states. [2019-09-08 03:00:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:43,069 INFO L93 Difference]: Finished difference Result 654 states and 713 transitions. [2019-09-08 03:00:43,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-08 03:00:43,069 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 468 [2019-09-08 03:00:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:43,070 INFO L225 Difference]: With dead ends: 654 [2019-09-08 03:00:43,071 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 03:00:43,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7199, Invalid=24307, Unknown=0, NotChecked=0, Total=31506 [2019-09-08 03:00:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 03:00:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-08 03:00:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 03:00:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2019-09-08 03:00:43,089 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 468 [2019-09-08 03:00:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:43,090 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2019-09-08 03:00:43,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-08 03:00:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2019-09-08 03:00:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 03:00:43,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:43,092 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:43,092 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1563501941, now seen corresponding path program 114 times [2019-09-08 03:00:43,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:43,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:43,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-08 03:00:44,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:44,542 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-08 03:00:44,553 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:00:44,800 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2019-09-08 03:00:44,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:44,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-08 03:00:44,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:44,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:00:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-08 03:00:44,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:44,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-08 03:00:44,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 03:00:44,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 03:00:44,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 03:00:44,966 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 65 states. [2019-09-08 03:00:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:45,654 INFO L93 Difference]: Finished difference Result 485 states and 487 transitions. [2019-09-08 03:00:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 03:00:45,654 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 469 [2019-09-08 03:00:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:45,657 INFO L225 Difference]: With dead ends: 485 [2019-09-08 03:00:45,657 INFO L226 Difference]: Without dead ends: 483 [2019-09-08 03:00:45,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 03:00:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-08 03:00:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2019-09-08 03:00:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-08 03:00:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2019-09-08 03:00:45,676 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 469 [2019-09-08 03:00:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:45,676 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2019-09-08 03:00:45,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 03:00:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2019-09-08 03:00:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 03:00:45,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:45,678 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:45,678 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash -739524584, now seen corresponding path program 115 times [2019-09-08 03:00:45,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:45,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:45,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-08 03:00:49,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:49,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 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-08 03:00:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:00:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:49,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-08 03:00:49,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-08 03:00:49,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:49,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-08 03:00:49,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-08 03:00:49,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-08 03:00:49,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3661, Invalid=10859, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 03:00:49,893 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 121 states. [2019-09-08 03:00:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:56,322 INFO L93 Difference]: Finished difference Result 665 states and 725 transitions. [2019-09-08 03:00:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-08 03:00:56,322 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 476 [2019-09-08 03:00:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:56,323 INFO L225 Difference]: With dead ends: 665 [2019-09-08 03:00:56,324 INFO L226 Difference]: Without dead ends: 480 [2019-09-08 03:00:56,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5191 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7441, Invalid=25139, Unknown=0, NotChecked=0, Total=32580 [2019-09-08 03:00:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-08 03:00:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-08 03:00:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-08 03:00:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2019-09-08 03:00:56,346 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 476 [2019-09-08 03:00:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:56,346 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2019-09-08 03:00:56,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-08 03:00:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2019-09-08 03:00:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-08 03:00:56,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:56,348 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:56,348 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1483053737, now seen corresponding path program 116 times [2019-09-08 03:00:56,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:56,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:56,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:00:56,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:00:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-08 03:00:57,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:00:57,908 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-08 03:00:57,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:00:58,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:00:58,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:00:58,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-08 03:00:58,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:00:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:00:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-08 03:00:58,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:00:58,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 66 [2019-09-08 03:00:58,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 03:00:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 03:00:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 03:00:58,291 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 66 states. [2019-09-08 03:00:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:00:58,888 INFO L93 Difference]: Finished difference Result 493 states and 495 transitions. [2019-09-08 03:00:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 03:00:58,888 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 477 [2019-09-08 03:00:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:00:58,890 INFO L225 Difference]: With dead ends: 493 [2019-09-08 03:00:58,890 INFO L226 Difference]: Without dead ends: 491 [2019-09-08 03:00:58,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 03:00:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-08 03:00:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2019-09-08 03:00:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-08 03:00:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2019-09-08 03:00:58,912 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 477 [2019-09-08 03:00:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:00:58,912 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2019-09-08 03:00:58,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 03:00:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2019-09-08 03:00:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-08 03:00:58,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:00:58,914 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:00:58,914 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:00:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:00:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash -677363142, now seen corresponding path program 117 times [2019-09-08 03:00:58,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:00:58,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:00:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:58,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:00:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:00:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-08 03:01:02,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:02,952 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-08 03:01:02,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:01:03,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-09-08 03:01:03,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:03,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-08 03:01:03,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-08 03:01:03,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:03,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-08 03:01:03,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-08 03:01:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-08 03:01:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 03:01:03,413 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 123 states. [2019-09-08 03:01:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:10,126 INFO L93 Difference]: Finished difference Result 676 states and 737 transitions. [2019-09-08 03:01:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-08 03:01:10,126 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 484 [2019-09-08 03:01:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:10,127 INFO L225 Difference]: With dead ends: 676 [2019-09-08 03:01:10,128 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 03:01:10,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5369 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7687, Invalid=25985, Unknown=0, NotChecked=0, Total=33672 [2019-09-08 03:01:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 03:01:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-08 03:01:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 03:01:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2019-09-08 03:01:10,148 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 484 [2019-09-08 03:01:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:10,148 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2019-09-08 03:01:10,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-08 03:01:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2019-09-08 03:01:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-08 03:01:10,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:10,150 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:10,150 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash 342031307, now seen corresponding path program 118 times [2019-09-08 03:01:10,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:10,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:10,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-08 03:01:11,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:11,689 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-08 03:01:11,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:01:11,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:01:11,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:11,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-08 03:01:11,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:11,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:01:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-08 03:01:12,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:12,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 67 [2019-09-08 03:01:12,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 03:01:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 03:01:12,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 03:01:12,067 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 67 states. [2019-09-08 03:01:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:12,885 INFO L93 Difference]: Finished difference Result 501 states and 503 transitions. [2019-09-08 03:01:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 03:01:12,886 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 485 [2019-09-08 03:01:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:12,888 INFO L225 Difference]: With dead ends: 501 [2019-09-08 03:01:12,888 INFO L226 Difference]: Without dead ends: 499 [2019-09-08 03:01:12,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 03:01:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-08 03:01:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2019-09-08 03:01:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 03:01:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2019-09-08 03:01:12,918 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 485 [2019-09-08 03:01:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:12,918 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2019-09-08 03:01:12,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 03:01:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2019-09-08 03:01:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-08 03:01:12,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:12,921 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:12,922 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 854308568, now seen corresponding path program 119 times [2019-09-08 03:01:12,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:12,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:12,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-08 03:01:17,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:17,138 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-08 03:01:17,148 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:01:17,581 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-08 03:01:17,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:17,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-08 03:01:17,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (120)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:01:17,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:17,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-08 03:01:17,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-08 03:01:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-08 03:01:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3907, Invalid=11593, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 03:01:17,748 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 125 states. [2019-09-08 03:01:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:22,235 INFO L93 Difference]: Finished difference Result 687 states and 749 transitions. [2019-09-08 03:01:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 03:01:22,235 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 492 [2019-09-08 03:01:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:22,237 INFO L225 Difference]: With dead ends: 687 [2019-09-08 03:01:22,237 INFO L226 Difference]: Without dead ends: 496 [2019-09-08 03:01:22,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5550 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7937, Invalid=26845, Unknown=0, NotChecked=0, Total=34782 [2019-09-08 03:01:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-08 03:01:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2019-09-08 03:01:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-08 03:01:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 497 transitions. [2019-09-08 03:01:22,259 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 497 transitions. Word has length 492 [2019-09-08 03:01:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:22,259 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 497 transitions. [2019-09-08 03:01:22,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-08 03:01:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 497 transitions. [2019-09-08 03:01:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-08 03:01:22,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:22,261 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:22,262 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash -56078487, now seen corresponding path program 120 times [2019-09-08 03:01:22,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:22,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:22,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:22,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:22,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-08 03:01:23,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:23,875 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-08 03:01:23,891 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:01:24,167 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-08 03:01:24,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:24,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-08 03:01:24,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:24,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:01:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-08 03:01:24,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:24,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 68 [2019-09-08 03:01:24,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 03:01:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 03:01:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 03:01:24,362 INFO L87 Difference]: Start difference. First operand 496 states and 497 transitions. Second operand 68 states. [2019-09-08 03:01:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:25,214 INFO L93 Difference]: Finished difference Result 509 states and 511 transitions. [2019-09-08 03:01:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 03:01:25,215 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 493 [2019-09-08 03:01:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:25,217 INFO L225 Difference]: With dead ends: 509 [2019-09-08 03:01:25,218 INFO L226 Difference]: Without dead ends: 507 [2019-09-08 03:01:25,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 03:01:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-08 03:01:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-08 03:01:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 03:01:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2019-09-08 03:01:25,242 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 493 [2019-09-08 03:01:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:25,243 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2019-09-08 03:01:25,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 03:01:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2019-09-08 03:01:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-08 03:01:25,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:25,245 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:25,245 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2121484934, now seen corresponding path program 121 times [2019-09-08 03:01:25,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:25,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:25,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-08 03:01:29,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:29,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 03:01:29,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:01:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:29,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-08 03:01:29,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-08 03:01:30,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:30,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-08 03:01:30,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-08 03:01:30,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-08 03:01:30,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4033, Invalid=11969, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 03:01:30,046 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 127 states. [2019-09-08 03:01:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:35,466 INFO L93 Difference]: Finished difference Result 698 states and 761 transitions. [2019-09-08 03:01:35,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-08 03:01:35,466 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 500 [2019-09-08 03:01:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:35,467 INFO L225 Difference]: With dead ends: 698 [2019-09-08 03:01:35,467 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 03:01:35,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8191, Invalid=27719, Unknown=0, NotChecked=0, Total=35910 [2019-09-08 03:01:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 03:01:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 03:01:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 03:01:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2019-09-08 03:01:35,500 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 500 [2019-09-08 03:01:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:35,501 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2019-09-08 03:01:35,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-08 03:01:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2019-09-08 03:01:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-08 03:01:35,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:35,504 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:35,504 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1811164427, now seen corresponding path program 122 times [2019-09-08 03:01:35,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:35,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:35,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:01:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-08 03:01:37,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:37,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 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-08 03:01:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:01:37,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:01:37,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:37,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-08 03:01:37,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:01:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-08 03:01:37,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:37,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 69 [2019-09-08 03:01:37,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 03:01:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 03:01:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 03:01:37,551 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 69 states. [2019-09-08 03:01:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:38,420 INFO L93 Difference]: Finished difference Result 517 states and 519 transitions. [2019-09-08 03:01:38,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 03:01:38,421 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 501 [2019-09-08 03:01:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:38,422 INFO L225 Difference]: With dead ends: 517 [2019-09-08 03:01:38,422 INFO L226 Difference]: Without dead ends: 515 [2019-09-08 03:01:38,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 03:01:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-08 03:01:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-09-08 03:01:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-08 03:01:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2019-09-08 03:01:38,444 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 501 [2019-09-08 03:01:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:38,444 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2019-09-08 03:01:38,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 03:01:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2019-09-08 03:01:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-08 03:01:38,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:38,446 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:38,447 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2015141272, now seen corresponding path program 123 times [2019-09-08 03:01:38,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:38,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:38,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-08 03:01:42,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:42,977 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-08 03:01:42,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:01:43,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-09-08 03:01:43,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:43,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-08 03:01:43,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-08 03:01:43,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:43,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-08 03:01:43,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-08 03:01:43,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-08 03:01:43,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4161, Invalid=12351, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 03:01:43,466 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 129 states. [2019-09-08 03:01:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:47,640 INFO L93 Difference]: Finished difference Result 709 states and 773 transitions. [2019-09-08 03:01:47,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-08 03:01:47,640 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 508 [2019-09-08 03:01:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:47,641 INFO L225 Difference]: With dead ends: 709 [2019-09-08 03:01:47,641 INFO L226 Difference]: Without dead ends: 512 [2019-09-08 03:01:47,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5921 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8449, Invalid=28607, Unknown=0, NotChecked=0, Total=37056 [2019-09-08 03:01:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-08 03:01:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-09-08 03:01:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 03:01:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2019-09-08 03:01:47,674 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 508 [2019-09-08 03:01:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:47,674 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2019-09-08 03:01:47,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-08 03:01:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2019-09-08 03:01:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-08 03:01:47,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:47,678 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:47,678 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash -706743255, now seen corresponding path program 124 times [2019-09-08 03:01:47,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:47,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:47,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:47,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:47,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-08 03:01:49,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:49,471 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-08 03:01:49,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:01:49,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:01:49,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:49,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-08 03:01:49,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:49,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:01:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-08 03:01:49,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:49,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 70 [2019-09-08 03:01:49,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 03:01:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 03:01:49,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 03:01:49,886 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 70 states. [2019-09-08 03:01:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:01:50,684 INFO L93 Difference]: Finished difference Result 525 states and 527 transitions. [2019-09-08 03:01:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 03:01:50,684 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 509 [2019-09-08 03:01:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:01:50,686 INFO L225 Difference]: With dead ends: 525 [2019-09-08 03:01:50,686 INFO L226 Difference]: Without dead ends: 523 [2019-09-08 03:01:50,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 03:01:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-08 03:01:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2019-09-08 03:01:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-08 03:01:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2019-09-08 03:01:50,710 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 509 [2019-09-08 03:01:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:01:50,711 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2019-09-08 03:01:50,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 03:01:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2019-09-08 03:01:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-08 03:01:50,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:01:50,713 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:01:50,713 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:01:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:01:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1444296890, now seen corresponding path program 125 times [2019-09-08 03:01:50,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:01:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:01:50,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:50,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:01:50,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:01:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:01:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-08 03:01:55,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:01:55,317 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-08 03:01:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:01:55,598 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 64 check-sat command(s) [2019-09-08 03:01:55,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:01:55,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-08 03:01:55,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:01:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-08 03:01:55,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:01:55,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-08 03:01:55,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-08 03:01:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-08 03:01:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4291, Invalid=12739, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 03:01:55,744 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 131 states. [2019-09-08 03:02:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:01,396 INFO L93 Difference]: Finished difference Result 720 states and 785 transitions. [2019-09-08 03:02:01,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-08 03:02:01,396 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 516 [2019-09-08 03:02:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:01,398 INFO L225 Difference]: With dead ends: 720 [2019-09-08 03:02:01,398 INFO L226 Difference]: Without dead ends: 520 [2019-09-08 03:02:01,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6111 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8711, Invalid=29509, Unknown=0, NotChecked=0, Total=38220 [2019-09-08 03:02:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-08 03:02:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-08 03:02:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-08 03:02:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2019-09-08 03:02:01,435 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 516 [2019-09-08 03:02:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:01,435 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2019-09-08 03:02:01,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-08 03:02:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2019-09-08 03:02:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-08 03:02:01,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:01,439 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:01,439 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash 954625611, now seen corresponding path program 126 times [2019-09-08 03:02:01,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:01,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:01,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:01,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2206 proven. 5985 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-08 03:02:03,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:03,386 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-08 03:02:03,396 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:02:03,696 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2019-09-08 03:02:03,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:03,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-08 03:02:03,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:02:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2232 proven. 6145 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (127)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:02:04,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:04,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 71] total 72 [2019-09-08 03:02:04,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-08 03:02:04,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-08 03:02:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2223, Invalid=2889, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 03:02:04,162 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 72 states. [2019-09-08 03:02:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:05,154 INFO L93 Difference]: Finished difference Result 529 states and 530 transitions. [2019-09-08 03:02:05,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 03:02:05,154 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 517 [2019-09-08 03:02:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:05,156 INFO L225 Difference]: With dead ends: 529 [2019-09-08 03:02:05,156 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 03:02:05,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 577 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2236, Invalid=3166, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 03:02:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 03:02:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-08 03:02:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-08 03:02:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2019-09-08 03:02:05,181 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 517 [2019-09-08 03:02:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:05,182 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2019-09-08 03:02:05,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-08 03:02:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2019-09-08 03:02:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-08 03:02:05,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:05,185 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:05,185 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1147505576, now seen corresponding path program 127 times [2019-09-08 03:02:05,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:05,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-08 03:02:09,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:09,934 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) [2019-09-08 03:02:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:02:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:10,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-08 03:02:10,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-08 03:02:10,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:10,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-08 03:02:10,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-08 03:02:10,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-08 03:02:10,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4423, Invalid=13133, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 03:02:10,269 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 133 states. [2019-09-08 03:02:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:15,959 INFO L93 Difference]: Finished difference Result 731 states and 797 transitions. [2019-09-08 03:02:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-08 03:02:15,959 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 524 [2019-09-08 03:02:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:15,960 INFO L225 Difference]: With dead ends: 731 [2019-09-08 03:02:15,960 INFO L226 Difference]: Without dead ends: 528 [2019-09-08 03:02:15,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6304 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8977, Invalid=30425, Unknown=0, NotChecked=0, Total=39402 [2019-09-08 03:02:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-08 03:02:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-09-08 03:02:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-08 03:02:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2019-09-08 03:02:15,996 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 524 [2019-09-08 03:02:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:15,996 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2019-09-08 03:02:15,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-08 03:02:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2019-09-08 03:02:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-08 03:02:16,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:16,000 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:16,000 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash -198670103, now seen corresponding path program 128 times [2019-09-08 03:02:16,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:16,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:02:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2273 proven. 6176 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-08 03:02:17,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:17,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:02:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:02:18,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:02:18,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:18,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-08 03:02:18,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:18,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:02:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2272 proven. 6366 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2019-09-08 03:02:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 72] total 73 [2019-09-08 03:02:18,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 03:02:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 03:02:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2290, Invalid=2966, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 03:02:18,377 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 73 states. [2019-09-08 03:02:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:19,259 INFO L93 Difference]: Finished difference Result 537 states and 538 transitions. [2019-09-08 03:02:19,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 03:02:19,260 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 525 [2019-09-08 03:02:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:19,263 INFO L225 Difference]: With dead ends: 537 [2019-09-08 03:02:19,263 INFO L226 Difference]: Without dead ends: 535 [2019-09-08 03:02:19,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 586 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2303, Invalid=3247, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 03:02:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-08 03:02:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-09-08 03:02:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-08 03:02:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2019-09-08 03:02:19,296 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 525 [2019-09-08 03:02:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:19,297 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2019-09-08 03:02:19,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 03:02:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2019-09-08 03:02:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-09-08 03:02:19,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:19,300 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:19,300 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash 765512698, now seen corresponding path program 129 times [2019-09-08 03:02:19,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:19,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:19,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-08 03:02:24,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:24,231 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-08 03:02:24,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:02:24,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-08 03:02:24,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:24,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-08 03:02:24,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-08 03:02:24,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-08 03:02:24,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-08 03:02:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-08 03:02:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4557, Invalid=13533, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 03:02:24,819 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 135 states. [2019-09-08 03:02:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:28,943 INFO L93 Difference]: Finished difference Result 742 states and 809 transitions. [2019-09-08 03:02:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-08 03:02:28,944 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 532 [2019-09-08 03:02:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:28,945 INFO L225 Difference]: With dead ends: 742 [2019-09-08 03:02:28,945 INFO L226 Difference]: Without dead ends: 536 [2019-09-08 03:02:28,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6500 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=9247, Invalid=31355, Unknown=0, NotChecked=0, Total=40602 [2019-09-08 03:02:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-08 03:02:28,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-09-08 03:02:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-09-08 03:02:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2019-09-08 03:02:28,982 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 532 [2019-09-08 03:02:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:28,983 INFO L475 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2019-09-08 03:02:28,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-08 03:02:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2019-09-08 03:02:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-09-08 03:02:28,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:28,986 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:28,986 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1268629387, now seen corresponding path program 130 times [2019-09-08 03:02:28,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:28,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:28,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17031 backedges. 2341 proven. 6370 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-08 03:02:30,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:30,966 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-08 03:02:30,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:02:31,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:02:31,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:31,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-08 03:02:31,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:31,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:02:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17031 backedges. 2340 proven. 6563 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2019-09-08 03:02:31,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:31,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 73] total 74 [2019-09-08 03:02:31,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-08 03:02:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-08 03:02:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2358, Invalid=3044, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 03:02:31,462 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 74 states. [2019-09-08 03:02:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:32,486 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2019-09-08 03:02:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 03:02:32,486 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 533 [2019-09-08 03:02:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:32,488 INFO L225 Difference]: With dead ends: 545 [2019-09-08 03:02:32,488 INFO L226 Difference]: Without dead ends: 543 [2019-09-08 03:02:32,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 595 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2371, Invalid=3329, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 03:02:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-08 03:02:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-09-08 03:02:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-08 03:02:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2019-09-08 03:02:32,511 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 533 [2019-09-08 03:02:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:32,511 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2019-09-08 03:02:32,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-08 03:02:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2019-09-08 03:02:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-09-08 03:02:32,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:32,513 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:32,513 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1266599144, now seen corresponding path program 131 times [2019-09-08 03:02:32,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:32,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:32,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:32,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:32,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17490 backedges. 6699 proven. 2211 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-08 03:02:37,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:37,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 03:02:37,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:02:37,807 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2019-09-08 03:02:37,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:37,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-08 03:02:37,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17490 backedges. 6699 proven. 2211 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-08 03:02:37,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:37,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-08 03:02:37,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-08 03:02:37,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-08 03:02:37,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4693, Invalid=13939, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 03:02:37,992 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 137 states. [2019-09-08 03:02:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:44,523 INFO L93 Difference]: Finished difference Result 753 states and 821 transitions. [2019-09-08 03:02:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-08 03:02:44,524 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 540 [2019-09-08 03:02:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:44,525 INFO L225 Difference]: With dead ends: 753 [2019-09-08 03:02:44,525 INFO L226 Difference]: Without dead ends: 544 [2019-09-08 03:02:44,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6699 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=9521, Invalid=32299, Unknown=0, NotChecked=0, Total=41820 [2019-09-08 03:02:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-08 03:02:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-09-08 03:02:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-08 03:02:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2019-09-08 03:02:44,548 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 540 [2019-09-08 03:02:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:44,548 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2019-09-08 03:02:44,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-08 03:02:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2019-09-08 03:02:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-09-08 03:02:44,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:44,551 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:44,551 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:44,551 INFO L82 PathProgramCache]: Analyzing trace with hash 111021481, now seen corresponding path program 132 times [2019-09-08 03:02:44,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:44,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:44,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17557 backedges. 2410 proven. 6567 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-08 03:02:46,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:46,497 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-08 03:02:46,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:02:46,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-08 03:02:46,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:02:46,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-08 03:02:46,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:46,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:02:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17557 backedges. 2439 proven. 6733 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2019-09-08 03:02:47,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:47,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 74] total 75 [2019-09-08 03:02:47,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 03:02:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 03:02:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2427, Invalid=3123, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 03:02:47,127 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 75 states. [2019-09-08 03:02:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:48,108 INFO L93 Difference]: Finished difference Result 553 states and 554 transitions. [2019-09-08 03:02:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 03:02:48,108 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 541 [2019-09-08 03:02:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:48,110 INFO L225 Difference]: With dead ends: 553 [2019-09-08 03:02:48,110 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 03:02:48,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 604 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2440, Invalid=3412, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 03:02:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 03:02:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 03:02:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 03:02:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2019-09-08 03:02:48,133 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 541 [2019-09-08 03:02:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2019-09-08 03:02:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 03:02:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2019-09-08 03:02:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-08 03:02:48,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:48,136 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:48,136 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1636855610, now seen corresponding path program 133 times [2019-09-08 03:02:48,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:48,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:02:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 6901 proven. 2278 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-08 03:02:53,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:02:53,287 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-08 03:02:53,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:02:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:02:53,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-08 03:02:53,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:02:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 6901 proven. 2278 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-08 03:02:53,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:02:53,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-08 03:02:53,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-08 03:02:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-08 03:02:53,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4831, Invalid=14351, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 03:02:53,667 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 139 states. [2019-09-08 03:02:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:02:58,234 INFO L93 Difference]: Finished difference Result 764 states and 833 transitions. [2019-09-08 03:02:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-08 03:02:58,234 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 548 [2019-09-08 03:02:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:02:58,235 INFO L225 Difference]: With dead ends: 764 [2019-09-08 03:02:58,235 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 03:02:58,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6901 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=9799, Invalid=33257, Unknown=0, NotChecked=0, Total=43056 [2019-09-08 03:02:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 03:02:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-09-08 03:02:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-08 03:02:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 553 transitions. [2019-09-08 03:02:58,261 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 553 transitions. Word has length 548 [2019-09-08 03:02:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:02:58,261 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 553 transitions. [2019-09-08 03:02:58,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-08 03:02:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 553 transitions. [2019-09-08 03:02:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-08 03:02:58,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:02:58,264 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:02:58,264 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:02:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:02:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash -176283445, now seen corresponding path program 134 times [2019-09-08 03:02:58,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:02:58,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:02:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:58,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:02:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:02:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18091 backedges. 2480 proven. 6767 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-08 03:03:00,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:00,233 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-08 03:03:00,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:03:00,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:03:00,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:00,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-08 03:03:00,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:00,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:03:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18091 backedges. 2479 proven. 6966 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2019-09-08 03:03:00,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:00,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 75] total 76 [2019-09-08 03:03:00,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 03:03:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 03:03:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2497, Invalid=3203, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 03:03:00,754 INFO L87 Difference]: Start difference. First operand 552 states and 553 transitions. Second operand 76 states. [2019-09-08 03:03:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:01,828 INFO L93 Difference]: Finished difference Result 561 states and 562 transitions. [2019-09-08 03:03:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 03:03:01,829 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 549 [2019-09-08 03:03:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:01,831 INFO L225 Difference]: With dead ends: 561 [2019-09-08 03:03:01,831 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 03:03:01,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 613 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2510, Invalid=3496, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 03:03:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 03:03:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-08 03:03:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-08 03:03:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2019-09-08 03:03:01,855 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 549 [2019-09-08 03:03:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:01,856 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2019-09-08 03:03:01,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 03:03:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2019-09-08 03:03:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-08 03:03:01,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:01,858 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:01,858 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2028794328, now seen corresponding path program 135 times [2019-09-08 03:03:01,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:01,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18564 backedges. 7106 proven. 2346 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-08 03:03:07,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:07,132 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-08 03:03:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:03:07,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-08 03:03:07,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:07,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-08 03:03:07,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18564 backedges. 7106 proven. 2346 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-08 03:03:07,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:07,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-08 03:03:07,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-08 03:03:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-08 03:03:07,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4971, Invalid=14769, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 03:03:07,717 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 141 states. [2019-09-08 03:03:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:14,111 INFO L93 Difference]: Finished difference Result 775 states and 845 transitions. [2019-09-08 03:03:14,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-08 03:03:14,111 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 556 [2019-09-08 03:03:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:14,112 INFO L225 Difference]: With dead ends: 775 [2019-09-08 03:03:14,112 INFO L226 Difference]: Without dead ends: 560 [2019-09-08 03:03:14,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7106 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10081, Invalid=34229, Unknown=0, NotChecked=0, Total=44310 [2019-09-08 03:03:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-08 03:03:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-08 03:03:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-08 03:03:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2019-09-08 03:03:14,136 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 556 [2019-09-08 03:03:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:14,137 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2019-09-08 03:03:14,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-08 03:03:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2019-09-08 03:03:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-08 03:03:14,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:14,139 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:14,139 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 459047529, now seen corresponding path program 136 times [2019-09-08 03:03:14,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:14,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:14,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18633 backedges. 2551 proven. 6970 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-08 03:03:16,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:16,171 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-08 03:03:16,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:03:16,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:03:16,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:16,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-08 03:03:16,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:16,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:03:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18633 backedges. 2550 proven. 7172 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2019-09-08 03:03:16,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:16,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 76] total 77 [2019-09-08 03:03:16,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 03:03:16,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 03:03:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2568, Invalid=3284, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 03:03:16,707 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 77 states. [2019-09-08 03:03:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:17,644 INFO L93 Difference]: Finished difference Result 569 states and 570 transitions. [2019-09-08 03:03:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 03:03:17,644 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 557 [2019-09-08 03:03:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:17,646 INFO L225 Difference]: With dead ends: 569 [2019-09-08 03:03:17,646 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 03:03:17,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 622 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2581, Invalid=3581, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 03:03:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 03:03:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-08 03:03:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-08 03:03:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2019-09-08 03:03:17,669 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 557 [2019-09-08 03:03:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:17,670 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2019-09-08 03:03:17,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 03:03:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2019-09-08 03:03:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-08 03:03:17,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:17,672 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:17,672 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash 206119546, now seen corresponding path program 137 times [2019-09-08 03:03:17,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:17,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:17,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:17,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 19113 backedges. 7314 proven. 2415 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-08 03:03:23,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:23,077 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-08 03:03:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:03:23,399 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 70 check-sat command(s) [2019-09-08 03:03:23,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:23,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-08 03:03:23,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 19113 backedges. 7314 proven. 2415 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-08 03:03:23,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:23,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-08 03:03:23,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-08 03:03:23,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-08 03:03:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5113, Invalid=15193, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 03:03:23,563 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 143 states. [2019-09-08 03:03:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:32,425 INFO L93 Difference]: Finished difference Result 786 states and 857 transitions. [2019-09-08 03:03:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-08 03:03:32,426 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 564 [2019-09-08 03:03:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:32,427 INFO L225 Difference]: With dead ends: 786 [2019-09-08 03:03:32,427 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 03:03:32,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=10367, Invalid=35215, Unknown=0, NotChecked=0, Total=45582 [2019-09-08 03:03:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 03:03:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-08 03:03:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 03:03:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2019-09-08 03:03:32,454 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 564 [2019-09-08 03:03:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:32,454 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2019-09-08 03:03:32,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-08 03:03:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2019-09-08 03:03:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-08 03:03:32,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:32,457 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:32,457 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1223397899, now seen corresponding path program 138 times [2019-09-08 03:03:32,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:32,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:32,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19183 backedges. 2623 proven. 7176 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-08 03:03:34,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:34,597 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-08 03:03:34,607 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:03:34,939 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 70 check-sat command(s) [2019-09-08 03:03:34,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:34,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-08 03:03:34,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:35,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:03:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19183 backedges. 2652 proven. 7351 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2019-09-08 03:03:35,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:35,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 77] total 78 [2019-09-08 03:03:35,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-08 03:03:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-08 03:03:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=3366, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 03:03:35,237 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 78 states. [2019-09-08 03:03:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:36,255 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2019-09-08 03:03:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 03:03:36,256 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 565 [2019-09-08 03:03:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:36,259 INFO L225 Difference]: With dead ends: 577 [2019-09-08 03:03:36,259 INFO L226 Difference]: Without dead ends: 575 [2019-09-08 03:03:36,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 631 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2653, Invalid=3667, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 03:03:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-08 03:03:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-09-08 03:03:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-08 03:03:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2019-09-08 03:03:36,297 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 565 [2019-09-08 03:03:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:36,298 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2019-09-08 03:03:36,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-08 03:03:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2019-09-08 03:03:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-08 03:03:36,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:36,302 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:36,302 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:36,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:36,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1039767704, now seen corresponding path program 139 times [2019-09-08 03:03:36,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:36,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:36,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19670 backedges. 7525 proven. 2485 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-08 03:03:42,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:42,067 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-08 03:03:42,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:42,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-08 03:03:42,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19670 backedges. 7525 proven. 2485 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-08 03:03:42,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:42,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-08 03:03:42,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-08 03:03:42,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-08 03:03:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=15623, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 03:03:42,464 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 145 states. [2019-09-08 03:03:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:50,698 INFO L93 Difference]: Finished difference Result 797 states and 869 transitions. [2019-09-08 03:03:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 03:03:50,698 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 572 [2019-09-08 03:03:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:50,699 INFO L225 Difference]: With dead ends: 797 [2019-09-08 03:03:50,699 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 03:03:50,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=10657, Invalid=36215, Unknown=0, NotChecked=0, Total=46872 [2019-09-08 03:03:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 03:03:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-08 03:03:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-08 03:03:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 577 transitions. [2019-09-08 03:03:50,736 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 577 transitions. Word has length 572 [2019-09-08 03:03:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:50,737 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 577 transitions. [2019-09-08 03:03:50,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-08 03:03:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 577 transitions. [2019-09-08 03:03:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-08 03:03:50,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:50,741 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:50,741 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1602217769, now seen corresponding path program 140 times [2019-09-08 03:03:50,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:50,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:03:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:03:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 19741 backedges. 2696 proven. 7385 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-08 03:03:52,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:03:52,899 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-08 03:03:52,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:03:53,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:03:53,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:03:53,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-08 03:03:53,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:03:53,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:03:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 19741 backedges. 2695 proven. 7593 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2019-09-08 03:03:53,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:03:53,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 78] total 79 [2019-09-08 03:03:53,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 03:03:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 03:03:53,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2713, Invalid=3449, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 03:03:53,455 INFO L87 Difference]: Start difference. First operand 576 states and 577 transitions. Second operand 79 states. [2019-09-08 03:03:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:03:54,354 INFO L93 Difference]: Finished difference Result 585 states and 586 transitions. [2019-09-08 03:03:54,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 03:03:54,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 573 [2019-09-08 03:03:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:03:54,356 INFO L225 Difference]: With dead ends: 585 [2019-09-08 03:03:54,356 INFO L226 Difference]: Without dead ends: 583 [2019-09-08 03:03:54,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2726, Invalid=3754, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 03:03:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-08 03:03:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-08 03:03:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 03:03:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2019-09-08 03:03:54,382 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 573 [2019-09-08 03:03:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:03:54,382 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2019-09-08 03:03:54,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 03:03:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2019-09-08 03:03:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-08 03:03:54,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:03:54,385 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:03:54,385 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:03:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:03:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1227810234, now seen corresponding path program 141 times [2019-09-08 03:03:54,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:03:54,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:03:54,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:54,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:03:54,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:03:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20235 backedges. 7739 proven. 2556 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2019-09-08 03:04:00,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:00,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 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-08 03:04:00,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:04:00,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-09-08 03:04:00,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:00,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-08 03:04:00,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 20235 backedges. 7739 proven. 2556 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2019-09-08 03:04:00,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:00,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-08 03:04:00,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-08 03:04:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-08 03:04:00,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5403, Invalid=16059, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 03:04:00,750 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 147 states. [2019-09-08 03:04:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:06,514 INFO L93 Difference]: Finished difference Result 808 states and 881 transitions. [2019-09-08 03:04:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-08 03:04:06,514 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 580 [2019-09-08 03:04:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:06,515 INFO L225 Difference]: With dead ends: 808 [2019-09-08 03:04:06,515 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 03:04:06,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7739 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=10951, Invalid=37229, Unknown=0, NotChecked=0, Total=48180 [2019-09-08 03:04:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 03:04:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-08 03:04:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 03:04:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 585 transitions. [2019-09-08 03:04:06,542 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 585 transitions. Word has length 580 [2019-09-08 03:04:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:06,542 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 585 transitions. [2019-09-08 03:04:06,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-08 03:04:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 585 transitions. [2019-09-08 03:04:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-09-08 03:04:06,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:06,545 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:06,545 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:06,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:06,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1498026827, now seen corresponding path program 142 times [2019-09-08 03:04:06,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:06,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:06,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 20307 backedges. 2770 proven. 7597 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2019-09-08 03:04:08,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:08,713 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-08 03:04:08,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:04:08,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:04:08,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:08,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-08 03:04:08,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:09,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:04:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20307 backedges. 2769 proven. 7808 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2019-09-08 03:04:09,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:09,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 79] total 80 [2019-09-08 03:04:09,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-08 03:04:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-08 03:04:09,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2787, Invalid=3533, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 03:04:09,283 INFO L87 Difference]: Start difference. First operand 584 states and 585 transitions. Second operand 80 states. [2019-09-08 03:04:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:10,344 INFO L93 Difference]: Finished difference Result 593 states and 594 transitions. [2019-09-08 03:04:10,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 03:04:10,345 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 581 [2019-09-08 03:04:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:10,347 INFO L225 Difference]: With dead ends: 593 [2019-09-08 03:04:10,347 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 03:04:10,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2800, Invalid=3842, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 03:04:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 03:04:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-08 03:04:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 03:04:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2019-09-08 03:04:10,373 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 581 [2019-09-08 03:04:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:10,374 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2019-09-08 03:04:10,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-08 03:04:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2019-09-08 03:04:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2019-09-08 03:04:10,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:10,376 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:10,377 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash 398667608, now seen corresponding path program 143 times [2019-09-08 03:04:10,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:10,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:10,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:10,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:10,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20808 backedges. 7956 proven. 2628 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2019-09-08 03:04:16,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:16,381 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-08 03:04:16,391 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:04:16,722 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2019-09-08 03:04:16,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:16,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-08 03:04:16,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20808 backedges. 7956 proven. 2628 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2019-09-08 03:04:16,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-08 03:04:16,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-08 03:04:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-08 03:04:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5551, Invalid=16501, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 03:04:16,904 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 149 states. [2019-09-08 03:04:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:26,493 INFO L93 Difference]: Finished difference Result 819 states and 893 transitions. [2019-09-08 03:04:26,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 03:04:26,493 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 588 [2019-09-08 03:04:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:26,494 INFO L225 Difference]: With dead ends: 819 [2019-09-08 03:04:26,494 INFO L226 Difference]: Without dead ends: 592 [2019-09-08 03:04:26,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7956 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=11249, Invalid=38257, Unknown=0, NotChecked=0, Total=49506 [2019-09-08 03:04:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-08 03:04:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-08 03:04:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-08 03:04:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 593 transitions. [2019-09-08 03:04:26,528 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 593 transitions. Word has length 588 [2019-09-08 03:04:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:26,528 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 593 transitions. [2019-09-08 03:04:26,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-08 03:04:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 593 transitions. [2019-09-08 03:04:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-09-08 03:04:26,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:26,532 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:26,532 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -551273495, now seen corresponding path program 144 times [2019-09-08 03:04:26,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:26,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:26,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:26,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20881 backedges. 2845 proven. 7812 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2019-09-08 03:04:28,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:28,788 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-08 03:04:28,797 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:04:29,166 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-08 03:04:29,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:29,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-08 03:04:29,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:29,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:04:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20881 backedges. 2874 proven. 7996 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2019-09-08 03:04:29,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:29,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 80] total 81 [2019-09-08 03:04:29,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 03:04:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 03:04:29,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=3618, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 03:04:29,504 INFO L87 Difference]: Start difference. First operand 592 states and 593 transitions. Second operand 81 states. [2019-09-08 03:04:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:30,555 INFO L93 Difference]: Finished difference Result 601 states and 602 transitions. [2019-09-08 03:04:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-08 03:04:30,556 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 589 [2019-09-08 03:04:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:30,557 INFO L225 Difference]: With dead ends: 601 [2019-09-08 03:04:30,558 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 03:04:30,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 658 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2875, Invalid=3931, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 03:04:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 03:04:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 03:04:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 03:04:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2019-09-08 03:04:30,588 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 589 [2019-09-08 03:04:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:30,588 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2019-09-08 03:04:30,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 03:04:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2019-09-08 03:04:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-09-08 03:04:30,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:30,591 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:30,591 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:30,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:30,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1957017850, now seen corresponding path program 145 times [2019-09-08 03:04:30,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:30,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:30,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:30,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:30,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21389 backedges. 8176 proven. 2701 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-08 03:04:36,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:36,647 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-08 03:04:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:36,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-08 03:04:36,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21389 backedges. 8176 proven. 2701 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-08 03:04:37,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:37,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-08 03:04:37,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-08 03:04:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-08 03:04:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5701, Invalid=16949, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 03:04:37,027 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 151 states. [2019-09-08 03:04:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:42,930 INFO L93 Difference]: Finished difference Result 830 states and 905 transitions. [2019-09-08 03:04:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-08 03:04:42,930 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 596 [2019-09-08 03:04:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:42,931 INFO L225 Difference]: With dead ends: 830 [2019-09-08 03:04:42,931 INFO L226 Difference]: Without dead ends: 600 [2019-09-08 03:04:42,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8176 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=11551, Invalid=39299, Unknown=0, NotChecked=0, Total=50850 [2019-09-08 03:04:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-08 03:04:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-09-08 03:04:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-08 03:04:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2019-09-08 03:04:42,962 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 596 [2019-09-08 03:04:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:42,962 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 601 transitions. [2019-09-08 03:04:42,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-08 03:04:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 601 transitions. [2019-09-08 03:04:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-09-08 03:04:42,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:42,965 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:42,965 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2063443083, now seen corresponding path program 146 times [2019-09-08 03:04:42,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:42,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:42,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:42,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:42,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 21463 backedges. 2921 proven. 8030 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-08 03:04:45,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:45,336 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-08 03:04:45,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:04:45,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:04:45,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:45,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-08 03:04:45,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:45,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:04:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21463 backedges. 2920 proven. 8247 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2019-09-08 03:04:45,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:45,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 81] total 82 [2019-09-08 03:04:45,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 03:04:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 03:04:45,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2938, Invalid=3704, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 03:04:45,862 INFO L87 Difference]: Start difference. First operand 600 states and 601 transitions. Second operand 82 states. [2019-09-08 03:04:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:46,862 INFO L93 Difference]: Finished difference Result 609 states and 610 transitions. [2019-09-08 03:04:46,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 03:04:46,863 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 597 [2019-09-08 03:04:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:46,865 INFO L225 Difference]: With dead ends: 609 [2019-09-08 03:04:46,865 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 03:04:46,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 667 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2951, Invalid=4021, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 03:04:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 03:04:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-08 03:04:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 03:04:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2019-09-08 03:04:46,890 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 597 [2019-09-08 03:04:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:46,891 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2019-09-08 03:04:46,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 03:04:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2019-09-08 03:04:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-09-08 03:04:46,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:46,893 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:46,894 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1184516584, now seen corresponding path program 147 times [2019-09-08 03:04:46,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:46,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:46,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:46,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21978 backedges. 8399 proven. 2775 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2019-09-08 03:04:53,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:53,106 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-08 03:04:53,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:04:53,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-09-08 03:04:53,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:53,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-08 03:04:53,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21978 backedges. 8399 proven. 2775 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2019-09-08 03:04:53,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:53,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2019-09-08 03:04:53,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-08 03:04:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-08 03:04:53,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5853, Invalid=17403, Unknown=0, NotChecked=0, Total=23256 [2019-09-08 03:04:53,748 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 153 states. [2019-09-08 03:05:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:02,761 INFO L93 Difference]: Finished difference Result 841 states and 917 transitions. [2019-09-08 03:05:02,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-08 03:05:02,761 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 604 [2019-09-08 03:05:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:02,762 INFO L225 Difference]: With dead ends: 841 [2019-09-08 03:05:02,762 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 03:05:02,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8399 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=11857, Invalid=40355, Unknown=0, NotChecked=0, Total=52212 [2019-09-08 03:05:02,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 03:05:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-08 03:05:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 03:05:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2019-09-08 03:05:02,791 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 604 [2019-09-08 03:05:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:02,792 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2019-09-08 03:05:02,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-08 03:05:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2019-09-08 03:05:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-08 03:05:02,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:02,794 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:02,795 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:02,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1164279977, now seen corresponding path program 148 times [2019-09-08 03:05:02,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:02,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:02,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:02,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 22053 backedges. 2998 proven. 8251 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2019-09-08 03:05:05,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:05,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 03:05:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:05:05,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:05:05,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:05,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-08 03:05:05,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:05,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:05:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22053 backedges. 2997 proven. 8471 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2019-09-08 03:05:05,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:05,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 82] total 83 [2019-09-08 03:05:05,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 03:05:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 03:05:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3015, Invalid=3791, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 03:05:05,747 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 83 states. [2019-09-08 03:05:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:06,799 INFO L93 Difference]: Finished difference Result 617 states and 618 transitions. [2019-09-08 03:05:06,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-08 03:05:06,800 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 605 [2019-09-08 03:05:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:06,801 INFO L225 Difference]: With dead ends: 617 [2019-09-08 03:05:06,801 INFO L226 Difference]: Without dead ends: 615 [2019-09-08 03:05:06,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 676 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3028, Invalid=4112, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 03:05:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-09-08 03:05:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-09-08 03:05:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 03:05:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2019-09-08 03:05:06,830 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 605 [2019-09-08 03:05:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:06,831 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2019-09-08 03:05:06,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 03:05:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2019-09-08 03:05:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-08 03:05:06,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:06,834 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:06,834 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1813093434, now seen corresponding path program 149 times [2019-09-08 03:05:06,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:06,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:06,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:06,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:06,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22575 backedges. 8625 proven. 2850 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2019-09-08 03:05:13,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:13,264 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-08 03:05:13,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:05:13,631 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2019-09-08 03:05:13,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:13,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-08 03:05:13,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22575 backedges. 8625 proven. 2850 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2019-09-08 03:05:13,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:13,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2019-09-08 03:05:13,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-08 03:05:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-08 03:05:13,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6007, Invalid=17863, Unknown=0, NotChecked=0, Total=23870 [2019-09-08 03:05:13,848 INFO L87 Difference]: Start difference. First operand 615 states and 616 transitions. Second operand 155 states. [2019-09-08 03:05:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:24,572 INFO L93 Difference]: Finished difference Result 852 states and 929 transitions. [2019-09-08 03:05:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-08 03:05:24,573 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 612 [2019-09-08 03:05:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:24,574 INFO L225 Difference]: With dead ends: 852 [2019-09-08 03:05:24,574 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 03:05:24,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8625 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=12167, Invalid=41425, Unknown=0, NotChecked=0, Total=53592 [2019-09-08 03:05:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 03:05:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-09-08 03:05:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-08 03:05:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 617 transitions. [2019-09-08 03:05:24,604 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 617 transitions. Word has length 612 [2019-09-08 03:05:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:24,604 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 617 transitions. [2019-09-08 03:05:24,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-08 03:05:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 617 transitions. [2019-09-08 03:05:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-09-08 03:05:24,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:24,607 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:24,607 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2090187317, now seen corresponding path program 150 times [2019-09-08 03:05:24,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:24,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:24,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 22651 backedges. 3076 proven. 8475 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2019-09-08 03:05:27,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:27,106 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-08 03:05:27,116 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:05:27,510 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 76 check-sat command(s) [2019-09-08 03:05:27,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:27,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-08 03:05:27,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:27,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:05:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22651 backedges. 3108 proven. 8665 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2019-09-08 03:05:27,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:27,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 83] total 84 [2019-09-08 03:05:27,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-08 03:05:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-08 03:05:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3093, Invalid=3879, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 03:05:27,942 INFO L87 Difference]: Start difference. First operand 616 states and 617 transitions. Second operand 84 states. [2019-09-08 03:05:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:29,090 INFO L93 Difference]: Finished difference Result 625 states and 626 transitions. [2019-09-08 03:05:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 03:05:29,090 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 613 [2019-09-08 03:05:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:29,092 INFO L225 Difference]: With dead ends: 625 [2019-09-08 03:05:29,092 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:05:29,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 685 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3106, Invalid=4204, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 03:05:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:05:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-08 03:05:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 03:05:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2019-09-08 03:05:29,122 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 613 [2019-09-08 03:05:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:29,122 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2019-09-08 03:05:29,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-08 03:05:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2019-09-08 03:05:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-09-08 03:05:29,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:29,125 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:29,125 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 889007320, now seen corresponding path program 151 times [2019-09-08 03:05:29,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:29,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:29,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 23180 backedges. 8854 proven. 2926 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2019-09-08 03:05:35,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:35,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 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-08 03:05:35,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:05:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:35,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-08 03:05:35,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23180 backedges. 8854 proven. 2926 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2019-09-08 03:05:36,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:36,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2019-09-08 03:05:36,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-08 03:05:36,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-08 03:05:36,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6163, Invalid=18329, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 03:05:36,089 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 157 states. [2019-09-08 03:05:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:47,275 INFO L93 Difference]: Finished difference Result 863 states and 941 transitions. [2019-09-08 03:05:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-08 03:05:47,275 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 620 [2019-09-08 03:05:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:47,276 INFO L225 Difference]: With dead ends: 863 [2019-09-08 03:05:47,277 INFO L226 Difference]: Without dead ends: 624 [2019-09-08 03:05:47,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8854 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=12481, Invalid=42509, Unknown=0, NotChecked=0, Total=54990 [2019-09-08 03:05:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-08 03:05:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-09-08 03:05:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-08 03:05:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 625 transitions. [2019-09-08 03:05:47,307 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 625 transitions. Word has length 620 [2019-09-08 03:05:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:47,308 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 625 transitions. [2019-09-08 03:05:47,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-08 03:05:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 625 transitions. [2019-09-08 03:05:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-09-08 03:05:47,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:47,311 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:47,311 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:47,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1671449239, now seen corresponding path program 152 times [2019-09-08 03:05:47,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:47,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:47,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:05:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 23257 backedges. 3155 proven. 8702 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2019-09-08 03:05:49,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:49,830 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-08 03:05:49,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:05:50,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:05:50,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:50,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-08 03:05:50,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:50,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:05:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 23257 backedges. 3154 proven. 8928 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2019-09-08 03:05:50,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:50,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 84] total 85 [2019-09-08 03:05:50,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 03:05:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 03:05:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3172, Invalid=3968, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 03:05:50,455 INFO L87 Difference]: Start difference. First operand 624 states and 625 transitions. Second operand 85 states. [2019-09-08 03:05:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:51,451 INFO L93 Difference]: Finished difference Result 633 states and 634 transitions. [2019-09-08 03:05:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 03:05:51,452 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 621 [2019-09-08 03:05:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:51,454 INFO L225 Difference]: With dead ends: 633 [2019-09-08 03:05:51,454 INFO L226 Difference]: Without dead ends: 631 [2019-09-08 03:05:51,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 694 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3185, Invalid=4297, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 03:05:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-08 03:05:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-09-08 03:05:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-08 03:05:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 632 transitions. [2019-09-08 03:05:51,482 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 632 transitions. Word has length 621 [2019-09-08 03:05:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:51,483 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 632 transitions. [2019-09-08 03:05:51,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 03:05:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 632 transitions. [2019-09-08 03:05:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-09-08 03:05:51,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:51,486 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:51,486 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:51,486 INFO L82 PathProgramCache]: Analyzing trace with hash -841576582, now seen corresponding path program 153 times [2019-09-08 03:05:51,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:51,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:51,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23793 backedges. 9086 proven. 3003 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2019-09-08 03:05:58,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:58,415 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-08 03:05:58,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:05:58,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-09-08 03:05:58,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:58,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-08 03:05:58,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23793 backedges. 9086 proven. 3003 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2019-09-08 03:05:59,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:59,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2019-09-08 03:05:59,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-08 03:05:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-08 03:05:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6321, Invalid=18801, Unknown=0, NotChecked=0, Total=25122 [2019-09-08 03:05:59,272 INFO L87 Difference]: Start difference. First operand 631 states and 632 transitions. Second operand 159 states. [2019-09-08 03:06:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:06:05,417 INFO L93 Difference]: Finished difference Result 874 states and 953 transitions. [2019-09-08 03:06:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-08 03:06:05,418 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 628 [2019-09-08 03:06:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:06:05,419 INFO L225 Difference]: With dead ends: 874 [2019-09-08 03:06:05,419 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 03:06:05,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=12799, Invalid=43607, Unknown=0, NotChecked=0, Total=56406 [2019-09-08 03:06:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 03:06:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-08 03:06:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-08 03:06:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 633 transitions. [2019-09-08 03:06:05,450 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 633 transitions. Word has length 628 [2019-09-08 03:06:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:06:05,450 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 633 transitions. [2019-09-08 03:06:05,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-08 03:06:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 633 transitions. [2019-09-08 03:06:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2019-09-08 03:06:05,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:06:05,453 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:06:05,453 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:06:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:06:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 150206219, now seen corresponding path program 154 times [2019-09-08 03:06:05,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:06:05,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:06:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:05,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:06:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:06:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 3235 proven. 8932 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2019-09-08 03:06:08,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:06:08,604 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-08 03:06:08,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:06:08,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:06:08,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:06:08,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-08 03:06:08,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:06:08,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:06:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 3234 proven. 9161 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2019-09-08 03:06:09,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:06:09,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 85] total 86 [2019-09-08 03:06:09,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-08 03:06:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-08 03:06:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=4058, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 03:06:09,191 INFO L87 Difference]: Start difference. First operand 632 states and 633 transitions. Second operand 86 states. [2019-09-08 03:06:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:06:10,353 INFO L93 Difference]: Finished difference Result 641 states and 642 transitions. [2019-09-08 03:06:10,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 03:06:10,354 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 629 [2019-09-08 03:06:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:06:10,355 INFO L225 Difference]: With dead ends: 641 [2019-09-08 03:06:10,355 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:06:10,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 703 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3265, Invalid=4391, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 03:06:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:06:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 03:06:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:06:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 640 transitions. [2019-09-08 03:06:10,385 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 640 transitions. Word has length 629 [2019-09-08 03:06:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:06:10,386 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 640 transitions. [2019-09-08 03:06:10,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-08 03:06:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 640 transitions. [2019-09-08 03:06:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-09-08 03:06:10,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:06:10,389 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:06:10,389 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:06:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:06:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1146776680, now seen corresponding path program 155 times [2019-09-08 03:06:10,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:06:10,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:06:10,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:10,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:06:10,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:06:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 24414 backedges. 9321 proven. 3081 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2019-09-08 03:06:17,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:06:17,322 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-08 03:06:17,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:06:17,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2019-09-08 03:06:17,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:06:17,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-08 03:06:17,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:06:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24414 backedges. 9321 proven. 3081 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2019-09-08 03:06:17,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:06:17,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2019-09-08 03:06:17,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-08 03:06:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-08 03:06:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6481, Invalid=19279, Unknown=0, NotChecked=0, Total=25760 [2019-09-08 03:06:17,934 INFO L87 Difference]: Start difference. First operand 639 states and 640 transitions. Second operand 161 states. [2019-09-08 03:06:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:06:26,905 INFO L93 Difference]: Finished difference Result 885 states and 965 transitions. [2019-09-08 03:06:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-08 03:06:26,906 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 636 [2019-09-08 03:06:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:06:26,907 INFO L225 Difference]: With dead ends: 885 [2019-09-08 03:06:26,907 INFO L226 Difference]: Without dead ends: 640 [2019-09-08 03:06:26,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9321 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13121, Invalid=44719, Unknown=0, NotChecked=0, Total=57840 [2019-09-08 03:06:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-08 03:06:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-09-08 03:06:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-08 03:06:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 641 transitions. [2019-09-08 03:06:26,942 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 641 transitions. Word has length 636 [2019-09-08 03:06:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:06:26,942 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 641 transitions. [2019-09-08 03:06:26,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-08 03:06:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 641 transitions. [2019-09-08 03:06:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2019-09-08 03:06:26,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:06:26,945 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:06:26,945 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:06:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:06:26,946 INFO L82 PathProgramCache]: Analyzing trace with hash 221174313, now seen corresponding path program 156 times [2019-09-08 03:06:26,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:06:26,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:06:26,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:26,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:06:26,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:06:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24493 backedges. 3316 proven. 9165 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2019-09-08 03:06:29,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:06:29,830 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-08 03:06:29,840 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:06:30,268 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-08 03:06:30,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:06:30,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-08 03:06:30,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:06:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:06:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24493 backedges. 3348 proven. 9364 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2019-09-08 03:06:30,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:06:30,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 86] total 87 [2019-09-08 03:06:30,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 03:06:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 03:06:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3333, Invalid=4149, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 03:06:30,621 INFO L87 Difference]: Start difference. First operand 640 states and 641 transitions. Second operand 87 states. [2019-09-08 03:06:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:06:32,187 INFO L93 Difference]: Finished difference Result 649 states and 650 transitions. [2019-09-08 03:06:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 03:06:32,187 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 637 [2019-09-08 03:06:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:06:32,189 INFO L225 Difference]: With dead ends: 649 [2019-09-08 03:06:32,189 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 03:06:32,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 712 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3346, Invalid=4486, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 03:06:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 03:06:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-08 03:06:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-08 03:06:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 648 transitions. [2019-09-08 03:06:32,233 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 648 transitions. Word has length 637 [2019-09-08 03:06:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:06:32,234 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 648 transitions. [2019-09-08 03:06:32,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 03:06:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 648 transitions. [2019-09-08 03:06:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-09-08 03:06:32,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:06:32,238 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:06:32,239 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:06:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:06:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 962106042, now seen corresponding path program 157 times [2019-09-08 03:06:32,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:06:32,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:06:32,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:32,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:06:32,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:06:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 25043 backedges. 9559 proven. 3160 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2019-09-08 03:06:39,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:06:39,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 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-08 03:06:39,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:06:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:06:39,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-08 03:06:39,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:06:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25043 backedges. 9559 proven. 3160 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2019-09-08 03:06:39,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:06:39,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2019-09-08 03:06:39,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-08 03:06:39,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-08 03:06:39,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6643, Invalid=19763, Unknown=0, NotChecked=0, Total=26406 [2019-09-08 03:06:39,752 INFO L87 Difference]: Start difference. First operand 647 states and 648 transitions. Second operand 163 states. [2019-09-08 03:06:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:06:45,353 INFO L93 Difference]: Finished difference Result 896 states and 977 transitions. [2019-09-08 03:06:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-08 03:06:45,353 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 644 [2019-09-08 03:06:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:06:45,354 INFO L225 Difference]: With dead ends: 896 [2019-09-08 03:06:45,355 INFO L226 Difference]: Without dead ends: 648 [2019-09-08 03:06:45,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9559 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13447, Invalid=45845, Unknown=0, NotChecked=0, Total=59292 [2019-09-08 03:06:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-08 03:06:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-09-08 03:06:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-08 03:06:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 649 transitions. [2019-09-08 03:06:45,405 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 649 transitions. Word has length 644 [2019-09-08 03:06:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:06:45,405 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 649 transitions. [2019-09-08 03:06:45,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-08 03:06:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 649 transitions. [2019-09-08 03:06:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-09-08 03:06:45,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:06:45,410 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:06:45,410 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:06:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:06:45,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1560364981, now seen corresponding path program 158 times [2019-09-08 03:06:45,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:06:45,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:06:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:45,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:06:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:06:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25123 backedges. 3398 proven. 9401 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2019-09-08 03:06:48,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:06:48,187 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-08 03:06:48,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:06:48,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:06:48,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:06:48,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-08 03:06:48,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:06:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:06:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 25123 backedges. 3397 proven. 9636 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2019-09-08 03:06:48,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:06:48,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 87] total 88 [2019-09-08 03:06:48,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-08 03:06:48,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-08 03:06:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3415, Invalid=4241, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 03:06:48,834 INFO L87 Difference]: Start difference. First operand 648 states and 649 transitions. Second operand 88 states. [2019-09-08 03:06:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:06:50,245 INFO L93 Difference]: Finished difference Result 657 states and 658 transitions. [2019-09-08 03:06:50,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 03:06:50,246 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 645 [2019-09-08 03:06:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:06:50,248 INFO L225 Difference]: With dead ends: 657 [2019-09-08 03:06:50,248 INFO L226 Difference]: Without dead ends: 655 [2019-09-08 03:06:50,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 721 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3428, Invalid=4582, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 03:06:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-08 03:06:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-09-08 03:06:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-08 03:06:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2019-09-08 03:06:50,283 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 645 [2019-09-08 03:06:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:06:50,284 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2019-09-08 03:06:50,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-08 03:06:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2019-09-08 03:06:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-09-08 03:06:50,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:06:50,287 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:06:50,287 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:06:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:06:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1568336472, now seen corresponding path program 159 times [2019-09-08 03:06:50,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:06:50,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:06:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:50,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:06:50,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:06:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:06:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 25680 backedges. 9800 proven. 3240 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2019-09-08 03:06:57,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:06:57,543 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-08 03:06:57,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:06:58,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-09-08 03:06:58,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:06:58,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-08 03:06:58,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:06:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25680 backedges. 9800 proven. 3240 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2019-09-08 03:06:58,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:06:58,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 165 [2019-09-08 03:06:58,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-08 03:06:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-08 03:06:58,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6807, Invalid=20253, Unknown=0, NotChecked=0, Total=27060 [2019-09-08 03:06:58,286 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 165 states. [2019-09-08 03:07:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:07,154 INFO L93 Difference]: Finished difference Result 907 states and 989 transitions. [2019-09-08 03:07:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-08 03:07:07,155 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 652 [2019-09-08 03:07:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:07,156 INFO L225 Difference]: With dead ends: 907 [2019-09-08 03:07:07,156 INFO L226 Difference]: Without dead ends: 656 [2019-09-08 03:07:07,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9800 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13777, Invalid=46985, Unknown=0, NotChecked=0, Total=60762 [2019-09-08 03:07:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-08 03:07:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-09-08 03:07:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-08 03:07:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 657 transitions. [2019-09-08 03:07:07,187 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 657 transitions. Word has length 652 [2019-09-08 03:07:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:07,188 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 657 transitions. [2019-09-08 03:07:07,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-08 03:07:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 657 transitions. [2019-09-08 03:07:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-09-08 03:07:07,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:07,191 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:07,191 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1611731223, now seen corresponding path program 160 times [2019-09-08 03:07:07,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:07,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:07,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:07,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:07,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 25761 backedges. 3481 proven. 9640 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2019-09-08 03:07:09,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:09,971 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-08 03:07:09,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:07:10,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:07:10,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:07:10,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-08 03:07:10,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:10,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:07:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25761 backedges. 3480 proven. 9878 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2019-09-08 03:07:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:07:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 88] total 89 [2019-09-08 03:07:10,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 03:07:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 03:07:10,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3498, Invalid=4334, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 03:07:10,635 INFO L87 Difference]: Start difference. First operand 656 states and 657 transitions. Second operand 89 states. [2019-09-08 03:07:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:11,801 INFO L93 Difference]: Finished difference Result 665 states and 666 transitions. [2019-09-08 03:07:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 03:07:11,802 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 653 [2019-09-08 03:07:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:11,803 INFO L225 Difference]: With dead ends: 665 [2019-09-08 03:07:11,804 INFO L226 Difference]: Without dead ends: 663 [2019-09-08 03:07:11,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 730 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3511, Invalid=4679, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 03:07:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-08 03:07:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-09-08 03:07:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-08 03:07:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 664 transitions. [2019-09-08 03:07:11,835 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 664 transitions. Word has length 653 [2019-09-08 03:07:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:11,836 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 664 transitions. [2019-09-08 03:07:11,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 03:07:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 664 transitions. [2019-09-08 03:07:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2019-09-08 03:07:11,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:11,839 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:11,839 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1896110598, now seen corresponding path program 161 times [2019-09-08 03:07:11,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:11,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:11,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:11,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:11,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26325 backedges. 10044 proven. 3321 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2019-09-08 03:07:19,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:19,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 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-08 03:07:19,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:07:19,746 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2019-09-08 03:07:19,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:07:19,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-08 03:07:19,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26325 backedges. 10044 proven. 3321 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2019-09-08 03:07:19,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:07:19,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 167 [2019-09-08 03:07:19,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-08 03:07:19,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-08 03:07:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6973, Invalid=20749, Unknown=0, NotChecked=0, Total=27722 [2019-09-08 03:07:19,999 INFO L87 Difference]: Start difference. First operand 663 states and 664 transitions. Second operand 167 states. [2019-09-08 03:07:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:29,124 INFO L93 Difference]: Finished difference Result 918 states and 1001 transitions. [2019-09-08 03:07:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-08 03:07:29,124 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 660 [2019-09-08 03:07:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:29,126 INFO L225 Difference]: With dead ends: 918 [2019-09-08 03:07:29,126 INFO L226 Difference]: Without dead ends: 664 [2019-09-08 03:07:29,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10044 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=14111, Invalid=48139, Unknown=0, NotChecked=0, Total=62250 [2019-09-08 03:07:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-08 03:07:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2019-09-08 03:07:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-08 03:07:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 665 transitions. [2019-09-08 03:07:29,161 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 665 transitions. Word has length 660 [2019-09-08 03:07:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:29,162 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 665 transitions. [2019-09-08 03:07:29,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-08 03:07:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 665 transitions. [2019-09-08 03:07:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-09-08 03:07:29,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:29,165 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:29,165 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash 703498635, now seen corresponding path program 162 times [2019-09-08 03:07:29,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:29,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:29,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:29,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 26407 backedges. 3565 proven. 9882 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2019-09-08 03:07:31,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:31,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 03:07:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:07:32,445 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2019-09-08 03:07:32,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:07:32,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-08 03:07:32,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:07:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 26407 backedges. 3600 proven. 10087 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2019-09-08 03:07:32,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:07:32,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 89] total 90 [2019-09-08 03:07:32,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-08 03:07:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-08 03:07:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3582, Invalid=4428, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 03:07:32,825 INFO L87 Difference]: Start difference. First operand 664 states and 665 transitions. Second operand 90 states. [2019-09-08 03:07:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:34,246 INFO L93 Difference]: Finished difference Result 673 states and 674 transitions. [2019-09-08 03:07:34,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 03:07:34,247 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 661 [2019-09-08 03:07:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:34,249 INFO L225 Difference]: With dead ends: 673 [2019-09-08 03:07:34,249 INFO L226 Difference]: Without dead ends: 671 [2019-09-08 03:07:34,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 739 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3595, Invalid=4777, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 03:07:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-08 03:07:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-09-08 03:07:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-08 03:07:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 672 transitions. [2019-09-08 03:07:34,282 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 672 transitions. Word has length 661 [2019-09-08 03:07:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:34,282 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 672 transitions. [2019-09-08 03:07:34,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-08 03:07:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 672 transitions. [2019-09-08 03:07:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-08 03:07:34,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:34,285 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:34,285 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash -912707304, now seen corresponding path program 163 times [2019-09-08 03:07:34,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:34,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:34,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:34,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 26978 backedges. 10291 proven. 3403 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2019-09-08 03:07:41,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:41,948 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-08 03:07:41,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:07:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:42,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-08 03:07:42,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26978 backedges. 10291 proven. 3403 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2019-09-08 03:07:42,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:07:42,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 169 [2019-09-08 03:07:42,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-08 03:07:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-08 03:07:42,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7141, Invalid=21251, Unknown=0, NotChecked=0, Total=28392 [2019-09-08 03:07:42,416 INFO L87 Difference]: Start difference. First operand 671 states and 672 transitions. Second operand 169 states. [2019-09-08 03:07:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:49,208 INFO L93 Difference]: Finished difference Result 929 states and 1013 transitions. [2019-09-08 03:07:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-08 03:07:49,208 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 668 [2019-09-08 03:07:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:49,210 INFO L225 Difference]: With dead ends: 929 [2019-09-08 03:07:49,210 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 03:07:49,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10291 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14449, Invalid=49307, Unknown=0, NotChecked=0, Total=63756 [2019-09-08 03:07:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 03:07:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2019-09-08 03:07:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-09-08 03:07:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 673 transitions. [2019-09-08 03:07:49,246 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 673 transitions. Word has length 668 [2019-09-08 03:07:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:49,246 INFO L475 AbstractCegarLoop]: Abstraction has 672 states and 673 transitions. [2019-09-08 03:07:49,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-08 03:07:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 673 transitions. [2019-09-08 03:07:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-09-08 03:07:49,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:49,249 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:49,249 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash -71568471, now seen corresponding path program 164 times [2019-09-08 03:07:49,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:49,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:49,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:49,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:07:49,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27061 backedges. 3650 proven. 10127 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2019-09-08 03:07:52,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:52,192 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-08 03:07:52,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:07:52,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:07:52,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:07:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-08 03:07:52,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:52,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:07:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 27061 backedges. 3649 proven. 10371 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2019-09-08 03:07:52,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:07:52,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 90] total 91 [2019-09-08 03:07:52,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 03:07:52,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 03:07:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3667, Invalid=4523, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 03:07:52,862 INFO L87 Difference]: Start difference. First operand 672 states and 673 transitions. Second operand 91 states. [2019-09-08 03:07:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:54,157 INFO L93 Difference]: Finished difference Result 681 states and 682 transitions. [2019-09-08 03:07:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 03:07:54,157 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 669 [2019-09-08 03:07:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:54,159 INFO L225 Difference]: With dead ends: 681 [2019-09-08 03:07:54,159 INFO L226 Difference]: Without dead ends: 679 [2019-09-08 03:07:54,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 748 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3680, Invalid=4876, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 03:07:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-08 03:07:54,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2019-09-08 03:07:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-08 03:07:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 680 transitions. [2019-09-08 03:07:54,191 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 680 transitions. Word has length 669 [2019-09-08 03:07:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:54,191 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 680 transitions. [2019-09-08 03:07:54,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 03:07:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 680 transitions. [2019-09-08 03:07:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-09-08 03:07:54,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:54,195 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:54,195 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:54,195 INFO L82 PathProgramCache]: Analyzing trace with hash 807651642, now seen corresponding path program 165 times [2019-09-08 03:07:54,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:54,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:54,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:54,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:54,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:08:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 27639 backedges. 10541 proven. 3486 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2019-09-08 03:08:02,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:08:02,119 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-08 03:08:02,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:08:02,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-08 03:08:02,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:08:02,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-08 03:08:02,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:08:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 27639 backedges. 10541 proven. 3486 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2019-09-08 03:08:02,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:08:02,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 171 [2019-09-08 03:08:02,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-08 03:08:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-08 03:08:02,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7311, Invalid=21759, Unknown=0, NotChecked=0, Total=29070 [2019-09-08 03:08:02,916 INFO L87 Difference]: Start difference. First operand 679 states and 680 transitions. Second operand 171 states. [2019-09-08 03:08:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:08:12,628 INFO L93 Difference]: Finished difference Result 940 states and 1025 transitions. [2019-09-08 03:08:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-08 03:08:12,628 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 676 [2019-09-08 03:08:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:08:12,630 INFO L225 Difference]: With dead ends: 940 [2019-09-08 03:08:12,630 INFO L226 Difference]: Without dead ends: 680 [2019-09-08 03:08:12,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10541 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14791, Invalid=50489, Unknown=0, NotChecked=0, Total=65280 [2019-09-08 03:08:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-08 03:08:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2019-09-08 03:08:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-08 03:08:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 681 transitions. [2019-09-08 03:08:12,665 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 681 transitions. Word has length 676 [2019-09-08 03:08:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:08:12,665 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 681 transitions. [2019-09-08 03:08:12,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-08 03:08:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 681 transitions. [2019-09-08 03:08:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-09-08 03:08:12,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:08:12,668 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:08:12,668 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:08:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:08:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -148411701, now seen corresponding path program 166 times [2019-09-08 03:08:12,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:08:12,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:08:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:08:12,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:08:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY