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-0883e75 [2019-09-05 11:59:12,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:59:12,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:59:12,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:59:12,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:59:12,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:59:12,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:59:12,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:59:12,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:59:12,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:59:12,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:59:12,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:59:12,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:59:12,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:59:12,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:59:12,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:59:12,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:59:12,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:59:12,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:59:12,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:59:12,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:59:12,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:59:12,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:59:12,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:59:12,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:59:12,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:59:12,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:59:12,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:59:12,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:59:12,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:59:12,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:59:12,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:59:12,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:59:12,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:59:12,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:59:12,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:59:12,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:59:12,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:59:12,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:59:12,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:59:12,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:59:12,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:59:12,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:59:12,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:59:12,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:59:12,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:59:12,323 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:59:12,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:59:12,323 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:59:12,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:59:12,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:59:12,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:59:12,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:59:12,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:59:12,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:59:12,324 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:59:12,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:59:12,325 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:59:12,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:59:12,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:59:12,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:59:12,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:59:12,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:59:12,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:59:12,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:59:12,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:59:12,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:59:12,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:59:12,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:59:12,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:59:12,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:59:12,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:59:12,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:59:12,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:59:12,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:59:12,376 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:59:12,377 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-05 11:59:12,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22379678/fd642de827ac463d9361dfaf7aae0dac/FLAG2d847524d [2019-09-05 11:59:12,883 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:59:12,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i [2019-09-05 11:59:12,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22379678/fd642de827ac463d9361dfaf7aae0dac/FLAG2d847524d [2019-09-05 11:59:13,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22379678/fd642de827ac463d9361dfaf7aae0dac [2019-09-05 11:59:13,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:59:13,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:59:13,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:13,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:59:13,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:59:13,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f537545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13, skipping insertion in model container [2019-09-05 11:59:13,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:59:13,331 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:59:13,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:13,525 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:59:13,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:13,552 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:59:13,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13 WrapperNode [2019-09-05 11:59:13,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:13,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:59:13,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:59:13,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:59:13,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... [2019-09-05 11:59:13,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:59:13,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:59:13,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:59:13,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:59:13,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:59:13,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:59:13,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:59:13,746 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:59:13,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:59:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:59:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:59:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:59:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:59:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:59:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:59:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:59:13,930 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:59:13,930 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 11:59:13,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:13 BoogieIcfgContainer [2019-09-05 11:59:13,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:59:13,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:59:13,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:59:13,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:59:13,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:59:13" (1/3) ... [2019-09-05 11:59:13,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5eae39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:13, skipping insertion in model container [2019-09-05 11:59:13,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:13" (2/3) ... [2019-09-05 11:59:13,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5eae39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:13, skipping insertion in model container [2019-09-05 11:59:13,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:13" (3/3) ... [2019-09-05 11:59:13,960 INFO L109 eAbstractionObserver]: Analyzing ICFG down.i [2019-09-05 11:59:13,989 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:59:14,013 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:59:14,048 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:59:14,078 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:59:14,079 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:59:14,079 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:59:14,080 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:59:14,080 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:59:14,080 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:59:14,080 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:59:14,080 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:59:14,080 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:59:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-05 11:59:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:59:14,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:14,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:14,105 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1785764952, now seen corresponding path program 1 times [2019-09-05 11:59:14,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:14,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:14,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:14,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:14,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:14,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:14,320 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-09-05 11:59:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:14,404 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-05 11:59:14,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:14,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 11:59:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:14,415 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:59:14,416 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:59:14,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:59:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:59:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:59:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-05 11:59:14,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-05 11:59:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:14,465 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-05 11:59:14,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-05 11:59:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:59:14,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:14,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:14,467 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1701245161, now seen corresponding path program 1 times [2019-09-05 11:59:14,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:14,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:14,534 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-05 11:59:14,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:14,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:59:14,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:59:14,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:59:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:14,537 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-05 11:59:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:14,602 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-05 11:59:14,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:59:14,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-05 11:59:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:14,606 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:59:14,606 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:59:14,607 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-05 11:59:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:59:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-05 11:59:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 11:59:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-05 11:59:14,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-09-05 11:59:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:14,619 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-05 11:59:14,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:59:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-05 11:59:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:59:14,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:14,621 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:14,621 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -186817542, now seen corresponding path program 1 times [2019-09-05 11:59:14,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:14,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:14,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:14,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:14,714 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-05 11:59:14,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:14,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:14,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:14,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:59:14,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:14,801 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-05 11:59:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-05 11:59:14,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:59:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:59:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:14,811 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-09-05 11:59:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:14,897 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-09-05 11:59:14,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:59:14,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-05 11:59:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:14,901 INFO L225 Difference]: With dead ends: 38 [2019-09-05 11:59:14,902 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 11:59:14,902 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-05 11:59:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 11:59:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 11:59:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:59:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-05 11:59:14,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-09-05 11:59:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:14,909 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-05 11:59:14,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:59:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-05 11:59:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:59:14,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:14,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:14,912 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash 151164811, now seen corresponding path program 2 times [2019-09-05 11:59:14,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:14,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:14,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:15,031 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-05 11:59:15,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:15,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:15,056 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-05 11:59:15,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:15,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:15,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:59:15,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:15,130 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-05 11:59:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-05 11:59:15,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:59:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:59:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:59:15,136 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-09-05 11:59:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:15,214 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-05 11:59:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:15,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-09-05 11:59:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:15,216 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:59:15,217 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:59:15,217 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-05 11:59:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:59:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-09-05 11:59:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:59:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-05 11:59:15,226 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2019-09-05 11:59:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:15,226 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-05 11:59:15,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:59:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-05 11:59:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:59:15,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:15,228 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:15,228 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash -596024552, now seen corresponding path program 3 times [2019-09-05 11:59:15,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:15,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:15,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:15,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:15,356 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-05 11:59:15,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:15,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:15,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:15,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:59:15,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:15,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:59:15,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:15,409 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-05 11:59:15,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:15,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-05 11:59:15,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:59:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:59:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:59:15,414 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2019-09-05 11:59:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:15,539 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-05 11:59:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:59:15,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-05 11:59:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:15,540 INFO L225 Difference]: With dead ends: 49 [2019-09-05 11:59:15,540 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:59:15,541 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-05 11:59:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:59:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-05 11:59:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:59:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-05 11:59:15,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2019-09-05 11:59:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:15,548 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-05 11:59:15,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:59:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-05 11:59:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:59:15,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:15,550 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:15,550 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542807, now seen corresponding path program 4 times [2019-09-05 11:59:15,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:15,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:15,626 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-05 11:59:15,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:15,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:15,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:15,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:15,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:59:15,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:15,705 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-05 11:59:15,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:15,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-05 11:59:15,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:59:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:59:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:59:15,710 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2019-09-05 11:59:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:15,774 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-05 11:59:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:59:15,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-05 11:59:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:15,776 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:59:15,776 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 11:59:15,777 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-05 11:59:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 11:59:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-05 11:59:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:59:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-05 11:59:15,783 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2019-09-05 11:59:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:15,784 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-05 11:59:15,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:59:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-05 11:59:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:59:15,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:15,785 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:15,786 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1844119354, now seen corresponding path program 5 times [2019-09-05 11:59:15,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:15,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:15,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:15,875 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-05 11:59:15,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:15,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:15,897 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-05 11:59:15,919 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:59:15,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:15,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:59:15,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:15,932 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-05 11:59:15,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:15,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-05 11:59:15,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:59:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:59:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:59:15,942 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2019-09-05 11:59:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:16,076 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-09-05 11:59:16,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:59:16,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-09-05 11:59:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:16,078 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:59:16,078 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:59:16,079 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-05 11:59:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:59:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-05 11:59:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:59:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-05 11:59:16,085 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2019-09-05 11:59:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:16,086 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-05 11:59:16,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:59:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-05 11:59:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:59:16,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:16,087 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:16,088 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 528545995, now seen corresponding path program 6 times [2019-09-05 11:59:16,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:16,165 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-05 11:59:16,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:16,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:16,181 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:16,203 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-05 11:59:16,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:16,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:59:16,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:16,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:16,256 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-05 11:59:16,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:16,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-05 11:59:16,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:59:16,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:59:16,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:59:16,263 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-05 11:59:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:16,355 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-05 11:59:16,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:59:16,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-05 11:59:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:16,359 INFO L225 Difference]: With dead ends: 53 [2019-09-05 11:59:16,359 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 11:59:16,360 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-05 11:59:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 11:59:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-09-05 11:59:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 11:59:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-05 11:59:16,372 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 37 [2019-09-05 11:59:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:16,374 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-05 11:59:16,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:59:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-05 11:59:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:59:16,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:16,378 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:16,378 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1720130008, now seen corresponding path program 7 times [2019-09-05 11:59:16,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:16,549 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-05 11:59:16,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:16,549 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-05 11:59:16,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:16,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:59:16,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:16,605 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-05 11:59:16,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:16,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-05 11:59:16,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:59:16,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:59:16,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:59:16,615 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2019-09-05 11:59:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:16,806 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-09-05 11:59:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:59:16,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-05 11:59:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:16,808 INFO L225 Difference]: With dead ends: 71 [2019-09-05 11:59:16,808 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 11:59:16,809 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-05 11:59:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 11:59:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-05 11:59:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 11:59:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-05 11:59:16,816 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2019-09-05 11:59:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:16,817 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-05 11:59:16,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:59:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-05 11:59:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-05 11:59:16,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:16,818 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:16,818 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 442428009, now seen corresponding path program 8 times [2019-09-05 11:59:16,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:16,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:16,895 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-05 11:59:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:16,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:16,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:16,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:16,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:59:16,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:16,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:16,984 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-05 11:59:16,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-05 11:59:16,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:59:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:59:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:59:16,991 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2019-09-05 11:59:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:17,073 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-05 11:59:17,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:59:17,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-09-05 11:59:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:17,075 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:59:17,076 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 11:59:17,077 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-05 11:59:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 11:59:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-05 11:59:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:59:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-05 11:59:17,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-09-05 11:59:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:17,088 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-05 11:59:17,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:59:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-05 11:59:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:59:17,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:17,090 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:17,090 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 21084794, now seen corresponding path program 9 times [2019-09-05 11:59:17,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:17,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:17,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:17,250 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-05 11:59:17,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:17,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:17,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:17,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:59:17,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:17,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:59:17,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:17,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:17,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-05 11:59:17,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:59:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:59:17,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:59:17,304 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2019-09-05 11:59:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:17,542 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-09-05 11:59:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:59:17,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-09-05 11:59:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:17,544 INFO L225 Difference]: With dead ends: 82 [2019-09-05 11:59:17,545 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 11:59:17,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:59:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 11:59:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-05 11:59:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 11:59:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-05 11:59:17,554 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2019-09-05 11:59:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:17,554 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-05 11:59:17,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:59:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-05 11:59:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-05 11:59:17,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:17,555 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:17,556 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2096338421, now seen corresponding path program 10 times [2019-09-05 11:59:17,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:17,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:17,661 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-05 11:59:17,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:17,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:17,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:17,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:17,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:17,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:59:17,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:17,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:17,743 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-05 11:59:17,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:17,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-05 11:59:17,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:59:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:59:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:59:17,749 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-09-05 11:59:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:17,859 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-05 11:59:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:59:17,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-05 11:59:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:17,862 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:59:17,862 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:59:17,862 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-05 11:59:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:59:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-05 11:59:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 11:59:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-05 11:59:17,870 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 53 [2019-09-05 11:59:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:17,870 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-05 11:59:17,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:59:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-05 11:59:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 11:59:17,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:17,871 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:17,872 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1572192408, now seen corresponding path program 11 times [2019-09-05 11:59:17,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,020 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-05 11:59:18,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:18,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:18,049 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:18,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:59:18,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:18,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:59:18,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:18,102 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-05 11:59:18,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:18,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-05 11:59:18,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:59:18,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:59:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:59:18,109 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2019-09-05 11:59:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:18,336 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-05 11:59:18,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:59:18,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-09-05 11:59:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:18,338 INFO L225 Difference]: With dead ends: 93 [2019-09-05 11:59:18,338 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 11:59:18,339 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-05 11:59:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 11:59:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-05 11:59:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 11:59:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-05 11:59:18,346 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2019-09-05 11:59:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:18,347 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-05 11:59:18,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:59:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-05 11:59:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-05 11:59:18,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:18,348 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:18,348 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:18,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash 941903657, now seen corresponding path program 12 times [2019-09-05 11:59:18,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:18,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:18,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:18,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,454 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-05 11:59:18,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:18,455 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-05 11:59:18,473 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-05 11:59:18,502 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:59:18,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:18,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:59:18,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:18,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:18,552 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-05 11:59:18,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:18,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-05 11:59:18,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:59:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:59:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:59:18,558 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2019-09-05 11:59:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:18,671 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-05 11:59:18,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:59:18,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-05 11:59:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:18,674 INFO L225 Difference]: With dead ends: 77 [2019-09-05 11:59:18,674 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 11:59:18,675 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-05 11:59:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 11:59:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-05 11:59:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 11:59:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-05 11:59:18,682 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 61 [2019-09-05 11:59:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:18,682 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-05 11:59:18,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:59:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-05 11:59:18,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 11:59:18,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:18,683 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:18,684 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1438286406, now seen corresponding path program 13 times [2019-09-05 11:59:18,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:18,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,852 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-05 11:59:18,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:18,853 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) [2019-09-05 11:59:18,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:59:18,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:18,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:18,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-05 11:59:18,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:59:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:59:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:59:18,944 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2019-09-05 11:59:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:19,225 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2019-09-05 11:59:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:59:19,226 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-09-05 11:59:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:19,227 INFO L225 Difference]: With dead ends: 104 [2019-09-05 11:59:19,228 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 11:59:19,229 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-05 11:59:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 11:59:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-05 11:59:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-05 11:59:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-05 11:59:19,248 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2019-09-05 11:59:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:19,248 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-05 11:59:19,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:59:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-05 11:59:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-05 11:59:19,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:19,249 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:19,250 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash 654895947, now seen corresponding path program 14 times [2019-09-05 11:59:19,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:19,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:19,380 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-05 11:59:19,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:19,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:19,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:19,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:19,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:19,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:59:19,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:19,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:19,464 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-05 11:59:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-05 11:59:19,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:59:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:59:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:59:19,471 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2019-09-05 11:59:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:19,576 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-05 11:59:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:59:19,578 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-09-05 11:59:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:19,580 INFO L225 Difference]: With dead ends: 85 [2019-09-05 11:59:19,580 INFO L226 Difference]: Without dead ends: 83 [2019-09-05 11:59:19,580 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-05 11:59:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-05 11:59:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-05 11:59:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 11:59:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-05 11:59:19,588 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-09-05 11:59:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:19,588 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-05 11:59:19,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:59:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-05 11:59:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 11:59:19,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:19,589 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:19,590 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash -165587112, now seen corresponding path program 15 times [2019-09-05 11:59:19,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:19,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:19,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:19,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:19,834 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-05 11:59:19,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:19,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:19,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:19,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:59:19,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:19,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:59:19,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:19,896 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-05 11:59:19,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:19,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-05 11:59:19,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:59:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:59:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:59:19,911 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2019-09-05 11:59:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:20,215 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-09-05 11:59:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:59:20,216 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-05 11:59:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:20,217 INFO L225 Difference]: With dead ends: 115 [2019-09-05 11:59:20,218 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 11:59:20,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:59:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 11:59:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-05 11:59:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 11:59:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-05 11:59:20,226 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 76 [2019-09-05 11:59:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:20,226 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-05 11:59:20,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:59:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-05 11:59:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-05 11:59:20,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:20,227 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:20,228 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash 501916649, now seen corresponding path program 16 times [2019-09-05 11:59:20,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:20,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:20,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:20,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:20,336 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-05 11:59:20,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:20,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:20,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:20,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:20,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:20,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:59:20,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:20,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:20,419 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-05 11:59:20,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:20,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-09-05 11:59:20,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:59:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:59:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:59:20,424 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 16 states. [2019-09-05 11:59:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:20,528 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-05 11:59:20,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:59:20,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-05 11:59:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:20,529 INFO L225 Difference]: With dead ends: 93 [2019-09-05 11:59:20,530 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 11:59:20,530 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-05 11:59:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 11:59:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-09-05 11:59:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 11:59:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-05 11:59:20,536 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 77 [2019-09-05 11:59:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:20,536 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-05 11:59:20,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:59:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-05 11:59:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-05 11:59:20,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:20,537 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:20,538 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1520807686, now seen corresponding path program 17 times [2019-09-05 11:59:20,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:20,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:20,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:20,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:20,744 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-05 11:59:20,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:20,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:20,757 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:20,795 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-05 11:59:20,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:20,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:59:20,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:20,826 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-05 11:59:20,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:20,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-05 11:59:20,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:59:20,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:59:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:59:20,831 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2019-09-05 11:59:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:21,174 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-09-05 11:59:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:59:21,174 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2019-09-05 11:59:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:21,175 INFO L225 Difference]: With dead ends: 126 [2019-09-05 11:59:21,175 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 11:59:21,177 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-05 11:59:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 11:59:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-05 11:59:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-05 11:59:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-05 11:59:21,184 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 84 [2019-09-05 11:59:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:21,184 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-05 11:59:21,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:59:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-05 11:59:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-05 11:59:21,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:21,185 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:21,185 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1071283339, now seen corresponding path program 18 times [2019-09-05 11:59:21,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:21,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:21,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:21,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:21,341 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-05 11:59:21,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:21,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:21,357 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:59:21,400 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-05 11:59:21,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:21,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:59:21,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:21,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:21,461 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-05 11:59:21,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:21,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-05 11:59:21,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:59:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:59:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:59:21,468 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 17 states. [2019-09-05 11:59:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:21,627 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-05 11:59:21,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:59:21,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-05 11:59:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:21,629 INFO L225 Difference]: With dead ends: 101 [2019-09-05 11:59:21,629 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 11:59:21,630 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-05 11:59:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 11:59:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-09-05 11:59:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 11:59:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-05 11:59:21,640 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 85 [2019-09-05 11:59:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:21,641 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-05 11:59:21,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:59:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-05 11:59:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-05 11:59:21,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:21,646 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:21,646 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash 48619032, now seen corresponding path program 19 times [2019-09-05 11:59:21,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:21,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:21,937 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-05 11:59:21,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:21,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:21,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:21,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:59:21,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:22,026 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-05 11:59:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:22,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-05 11:59:22,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:59:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:59:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:59:22,031 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2019-09-05 11:59:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:22,531 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-09-05 11:59:22,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:59:22,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-09-05 11:59:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:22,534 INFO L225 Difference]: With dead ends: 137 [2019-09-05 11:59:22,534 INFO L226 Difference]: Without dead ends: 96 [2019-09-05 11:59:22,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:59:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-05 11:59:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-05 11:59:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-05 11:59:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-05 11:59:22,542 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2019-09-05 11:59:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:22,542 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-05 11:59:22,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:59:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-05 11:59:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-05 11:59:22,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:22,544 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:22,544 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1764890455, now seen corresponding path program 20 times [2019-09-05 11:59:22,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:22,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:22,680 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-05 11:59:22,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:22,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:22,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:22,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:22,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:22,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 11:59:22,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:22,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:22,787 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-05 11:59:22,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:22,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-09-05 11:59:22,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:59:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:59:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:59:22,792 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 18 states. [2019-09-05 11:59:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:22,941 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-05 11:59:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:59:22,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-05 11:59:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:22,946 INFO L225 Difference]: With dead ends: 109 [2019-09-05 11:59:22,946 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 11:59:22,947 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-05 11:59:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 11:59:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-05 11:59:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-05 11:59:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-05 11:59:22,953 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 93 [2019-09-05 11:59:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:22,954 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-05 11:59:22,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:59:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-05 11:59:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-05 11:59:22,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:22,955 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:22,955 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1343998918, now seen corresponding path program 21 times [2019-09-05 11:59:22,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:22,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:22,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:23,211 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-05 11:59:23,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:23,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:23,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:23,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 11:59:23,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:23,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:59:23,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:23,281 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-05 11:59:23,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:23,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-05 11:59:23,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:59:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:59:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:59:23,286 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2019-09-05 11:59:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:23,803 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-09-05 11:59:23,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:59:23,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-09-05 11:59:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:23,807 INFO L225 Difference]: With dead ends: 148 [2019-09-05 11:59:23,808 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 11:59:23,808 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-05 11:59:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 11:59:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-05 11:59:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 11:59:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-05 11:59:23,815 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 100 [2019-09-05 11:59:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:23,815 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-05 11:59:23,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:59:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-05 11:59:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-05 11:59:23,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:23,816 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:23,816 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2098913845, now seen corresponding path program 22 times [2019-09-05 11:59:23,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:23,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:23,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:23,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:23,986 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-05 11:59:23,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:23,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:24,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:24,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:24,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:24,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:59:24,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:24,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:24,083 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-05 11:59:24,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:24,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-09-05 11:59:24,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:59:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:59:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:59:24,089 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 19 states. [2019-09-05 11:59:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:24,218 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-05 11:59:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:59:24,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-05 11:59:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:24,220 INFO L225 Difference]: With dead ends: 117 [2019-09-05 11:59:24,220 INFO L226 Difference]: Without dead ends: 115 [2019-09-05 11:59:24,221 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-05 11:59:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-05 11:59:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-09-05 11:59:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 11:59:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-05 11:59:24,227 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 101 [2019-09-05 11:59:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:24,228 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-05 11:59:24,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:59:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-05 11:59:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-05 11:59:24,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:24,229 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:24,229 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1239460648, now seen corresponding path program 23 times [2019-09-05 11:59:24,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:24,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:24,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:24,541 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-05 11:59:24,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:24,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:24,558 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:24,609 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-05 11:59:24,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:24,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 11:59:24,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:24,635 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-05 11:59:24,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:24,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-05 11:59:24,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:59:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:59:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:59:24,641 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2019-09-05 11:59:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:25,234 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-09-05 11:59:25,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:59:25,239 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2019-09-05 11:59:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:25,240 INFO L225 Difference]: With dead ends: 159 [2019-09-05 11:59:25,240 INFO L226 Difference]: Without dead ends: 112 [2019-09-05 11:59:25,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:59:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-05 11:59:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-05 11:59:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 11:59:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-05 11:59:25,248 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 108 [2019-09-05 11:59:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:25,248 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-05 11:59:25,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:59:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-05 11:59:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-05 11:59:25,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:25,249 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:25,249 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash -857072279, now seen corresponding path program 24 times [2019-09-05 11:59:25,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:25,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:25,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:25,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:25,413 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-05 11:59:25,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:25,413 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-05 11:59:25,432 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-05 11:59:25,476 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:59:25,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:25,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 11:59:25,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:25,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:25,518 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-05 11:59:25,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:25,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-05 11:59:25,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:59:25,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:59:25,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:59:25,522 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 20 states. [2019-09-05 11:59:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:25,662 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-09-05 11:59:25,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:59:25,663 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-05 11:59:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:25,664 INFO L225 Difference]: With dead ends: 125 [2019-09-05 11:59:25,665 INFO L226 Difference]: Without dead ends: 123 [2019-09-05 11:59:25,665 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-05 11:59:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-05 11:59:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-05 11:59:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-05 11:59:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-05 11:59:25,672 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 109 [2019-09-05 11:59:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:25,672 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-05 11:59:25,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:59:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-05 11:59:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-05 11:59:25,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:25,674 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:25,674 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1212622714, now seen corresponding path program 25 times [2019-09-05 11:59:25,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:25,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:26,011 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-05 11:59:26,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:26,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:26,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:59:26,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:26,085 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-05 11:59:26,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:26,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-05 11:59:26,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:59:26,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:59:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:59:26,107 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2019-09-05 11:59:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:26,745 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-09-05 11:59:26,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:59:26,746 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-09-05 11:59:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:26,747 INFO L225 Difference]: With dead ends: 170 [2019-09-05 11:59:26,748 INFO L226 Difference]: Without dead ends: 120 [2019-09-05 11:59:26,749 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-05 11:59:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-05 11:59:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-05 11:59:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-05 11:59:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-05 11:59:26,757 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2019-09-05 11:59:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:26,758 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-05 11:59:26,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:59:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-05 11:59:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-05 11:59:26,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:26,759 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:26,759 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1720504075, now seen corresponding path program 26 times [2019-09-05 11:59:26,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:26,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:26,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:26,995 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-05 11:59:26,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:26,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:27,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:27,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:27,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:27,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:59:27,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:27,094 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-05 11:59:27,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:27,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-09-05 11:59:27,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:59:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:59:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:59:27,099 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2019-09-05 11:59:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:27,278 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-09-05 11:59:27,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:59:27,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2019-09-05 11:59:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:27,279 INFO L225 Difference]: With dead ends: 133 [2019-09-05 11:59:27,279 INFO L226 Difference]: Without dead ends: 131 [2019-09-05 11:59:27,280 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-05 11:59:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-05 11:59:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-09-05 11:59:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-05 11:59:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-05 11:59:27,286 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 117 [2019-09-05 11:59:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:27,286 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-05 11:59:27,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:59:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-05 11:59:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-05 11:59:27,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:27,287 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:27,288 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:27,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1625930648, now seen corresponding path program 27 times [2019-09-05 11:59:27,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:27,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:27,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:27,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:27,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:27,794 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-05 11:59:27,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:27,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:27,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:27,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 11:59:27,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:27,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 11:59:27,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Stream closed [2019-09-05 11:59:27,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:27,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-05 11:59:27,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:59:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:59:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:59:27,950 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2019-09-05 11:59:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:28,364 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2019-09-05 11:59:28,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:59:28,364 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-09-05 11:59:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:28,365 INFO L225 Difference]: With dead ends: 181 [2019-09-05 11:59:28,365 INFO L226 Difference]: Without dead ends: 128 [2019-09-05 11:59:28,366 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-05 11:59:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-05 11:59:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-05 11:59:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 11:59:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-05 11:59:28,377 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 124 [2019-09-05 11:59:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:28,377 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-05 11:59:28,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:59:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-05 11:59:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-05 11:59:28,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:28,379 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:28,379 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 156975657, now seen corresponding path program 28 times [2019-09-05 11:59:28,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:28,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:28,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:28,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:28,578 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-05 11:59:28,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:28,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:28,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:28,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:28,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:28,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 11:59:28,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:28,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:28,685 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-05 11:59:28,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-09-05 11:59:28,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:59:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:59:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:59:28,690 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 22 states. [2019-09-05 11:59:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:28,887 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-09-05 11:59:28,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:59:28,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-05 11:59:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:28,893 INFO L225 Difference]: With dead ends: 141 [2019-09-05 11:59:28,893 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 11:59:28,894 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-05 11:59:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 11:59:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-05 11:59:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-05 11:59:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-09-05 11:59:28,901 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 125 [2019-09-05 11:59:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:28,901 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-09-05 11:59:28,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:59:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-09-05 11:59:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-05 11:59:28,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:28,903 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:28,903 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -303617350, now seen corresponding path program 29 times [2019-09-05 11:59:28,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:28,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:29,508 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-05 11:59:29,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:29,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:29,532 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:29,603 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-05 11:59:29,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:29,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:59:29,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:29,635 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-05 11:59:29,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:29,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-05 11:59:29,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:59:29,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:59:29,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:59:29,642 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2019-09-05 11:59:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:30,423 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2019-09-05 11:59:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:59:30,424 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-09-05 11:59:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:30,425 INFO L225 Difference]: With dead ends: 192 [2019-09-05 11:59:30,425 INFO L226 Difference]: Without dead ends: 136 [2019-09-05 11:59:30,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=647, Invalid=2005, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 11:59:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-05 11:59:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-05 11:59:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-05 11:59:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-05 11:59:30,434 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 132 [2019-09-05 11:59:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:30,434 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-05 11:59:30,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:59:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-05 11:59:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-05 11:59:30,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:30,436 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:30,436 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1647677515, now seen corresponding path program 30 times [2019-09-05 11:59:30,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:30,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:30,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:30,641 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-05 11:59:30,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:30,642 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) [2019-09-05 11:59:30,655 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:30,738 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-05 11:59:30,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:30,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:59:30,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:30,811 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-05 11:59:30,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:30,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-05 11:59:30,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:59:30,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:59:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:59:30,819 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 23 states. [2019-09-05 11:59:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:31,014 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-09-05 11:59:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:59:31,015 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-05 11:59:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:31,016 INFO L225 Difference]: With dead ends: 149 [2019-09-05 11:59:31,016 INFO L226 Difference]: Without dead ends: 147 [2019-09-05 11:59:31,017 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-05 11:59:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-05 11:59:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-05 11:59:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-05 11:59:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-09-05 11:59:31,026 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 133 [2019-09-05 11:59:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:31,026 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-09-05 11:59:31,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:59:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-09-05 11:59:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-05 11:59:31,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:31,028 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:31,028 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash 861999704, now seen corresponding path program 31 times [2019-09-05 11:59:31,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:31,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:31,558 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-05 11:59:31,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:31,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:31,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:31,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 11:59:31,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:31,673 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-05 11:59:31,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:31,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-05 11:59:31,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:59:31,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:59:31,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:59:31,681 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2019-09-05 11:59:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:32,549 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2019-09-05 11:59:32,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:59:32,550 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-09-05 11:59:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:32,551 INFO L225 Difference]: With dead ends: 203 [2019-09-05 11:59:32,551 INFO L226 Difference]: Without dead ends: 144 [2019-09-05 11:59:32,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=721, Invalid=2249, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:59:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-05 11:59:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-05 11:59:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-05 11:59:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-05 11:59:32,560 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 140 [2019-09-05 11:59:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:32,560 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-05 11:59:32,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:59:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-05 11:59:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-05 11:59:32,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:32,562 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:32,562 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1950177001, now seen corresponding path program 32 times [2019-09-05 11:59:32,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:32,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:32,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:32,823 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-05 11:59:32,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:32,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:32,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:32,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:32,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:32,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 11:59:32,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:33,041 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-05 11:59:33,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:33,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-05 11:59:33,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:59:33,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:59:33,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:59:33,047 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 24 states. [2019-09-05 11:59:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:33,217 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-09-05 11:59:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:59:33,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2019-09-05 11:59:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:33,219 INFO L225 Difference]: With dead ends: 157 [2019-09-05 11:59:33,219 INFO L226 Difference]: Without dead ends: 155 [2019-09-05 11:59:33,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:59:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-05 11:59:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-09-05 11:59:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-05 11:59:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-09-05 11:59:33,232 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2019-09-05 11:59:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:33,233 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-09-05 11:59:33,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:59:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-09-05 11:59:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-05 11:59:33,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:33,234 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:33,234 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1630027258, now seen corresponding path program 33 times [2019-09-05 11:59:33,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:33,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:33,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:33,710 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-05 11:59:33,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:33,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:33,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 11:59:33,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:33,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:59:33,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:33,816 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-05 11:59:33,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:33,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-05 11:59:33,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:59:33,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:59:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:59:33,823 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2019-09-05 11:59:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:35,152 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2019-09-05 11:59:35,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 11:59:35,158 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2019-09-05 11:59:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:35,159 INFO L225 Difference]: With dead ends: 214 [2019-09-05 11:59:35,159 INFO L226 Difference]: Without dead ends: 152 [2019-09-05 11:59:35,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=799, Invalid=2507, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 11:59:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-05 11:59:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-05 11:59:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-05 11:59:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-05 11:59:35,169 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 148 [2019-09-05 11:59:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:35,169 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-05 11:59:35,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:59:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-05 11:59:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-05 11:59:35,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:35,171 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:35,171 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash 776167819, now seen corresponding path program 34 times [2019-09-05 11:59:35,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:35,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:35,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:35,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:35,405 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-05 11:59:35,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:35,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:35,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:35,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:35,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:35,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:59:35,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:35,525 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-05 11:59:35,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:35,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-09-05 11:59:35,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:59:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:59:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:59:35,530 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 25 states. [2019-09-05 11:59:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:35,774 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2019-09-05 11:59:35,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:59:35,774 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-09-05 11:59:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:35,775 INFO L225 Difference]: With dead ends: 165 [2019-09-05 11:59:35,775 INFO L226 Difference]: Without dead ends: 163 [2019-09-05 11:59:35,776 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-05 11:59:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-05 11:59:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-05 11:59:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-05 11:59:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-05 11:59:35,782 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2019-09-05 11:59:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:35,783 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-05 11:59:35,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:59:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-05 11:59:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-05 11:59:35,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:35,784 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:35,784 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash -56534760, now seen corresponding path program 35 times [2019-09-05 11:59:35,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:35,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:35,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:36,301 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-05 11:59:36,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:36,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:36,315 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:36,382 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-05 11:59:36,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:36,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 11:59:36,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:36,423 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-05 11:59:36,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:36,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-05 11:59:36,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:59:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:59:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:59:36,427 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2019-09-05 11:59:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:37,335 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2019-09-05 11:59:37,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 11:59:37,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-09-05 11:59:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:37,338 INFO L225 Difference]: With dead ends: 225 [2019-09-05 11:59:37,338 INFO L226 Difference]: Without dead ends: 160 [2019-09-05 11:59:37,340 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-05 11:59:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-05 11:59:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-05 11:59:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-05 11:59:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-05 11:59:37,350 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 156 [2019-09-05 11:59:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:37,350 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-05 11:59:37,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:59:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-05 11:59:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-05 11:59:37,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:37,351 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:37,352 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash -726901847, now seen corresponding path program 36 times [2019-09-05 11:59:37,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:37,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:37,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:37,631 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-05 11:59:37,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:37,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:37,641 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:59:37,700 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:59:37,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:37,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 11:59:37,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:37,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:37,771 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-05 11:59:37,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:37,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-05 11:59:37,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:59:37,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:59:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:59:37,775 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 26 states. [2019-09-05 11:59:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:38,033 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-09-05 11:59:38,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:59:38,033 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-09-05 11:59:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:38,034 INFO L225 Difference]: With dead ends: 173 [2019-09-05 11:59:38,034 INFO L226 Difference]: Without dead ends: 171 [2019-09-05 11:59:38,035 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-05 11:59:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-05 11:59:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-09-05 11:59:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-05 11:59:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-09-05 11:59:38,044 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 157 [2019-09-05 11:59:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:38,046 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-09-05 11:59:38,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:59:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-09-05 11:59:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-05 11:59:38,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:38,047 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:38,047 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash -479305414, now seen corresponding path program 37 times [2019-09-05 11:59:38,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:38,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:38,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:38,689 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-05 11:59:38,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:38,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:38,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:38,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:59:38,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:38,788 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-05 11:59:38,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:38,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-05 11:59:38,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:59:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:59:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:59:38,793 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2019-09-05 11:59:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:40,109 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2019-09-05 11:59:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 11:59:40,109 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-09-05 11:59:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:40,111 INFO L225 Difference]: With dead ends: 236 [2019-09-05 11:59:40,111 INFO L226 Difference]: Without dead ends: 168 [2019-09-05 11:59:40,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 11:59:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-05 11:59:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-05 11:59:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-05 11:59:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-05 11:59:40,122 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 164 [2019-09-05 11:59:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:40,122 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-05 11:59:40,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:59:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-05 11:59:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-05 11:59:40,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:40,123 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:40,124 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:40,124 INFO L82 PathProgramCache]: Analyzing trace with hash 68829899, now seen corresponding path program 38 times [2019-09-05 11:59:40,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:40,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:40,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:40,443 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-05 11:59:40,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:40,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:40,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:40,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:40,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:40,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:59:40,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:40,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:40,578 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-05 11:59:40,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-09-05 11:59:40,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:59:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:59:40,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:59:40,585 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 27 states. [2019-09-05 11:59:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:40,780 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2019-09-05 11:59:40,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:59:40,783 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 165 [2019-09-05 11:59:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:40,784 INFO L225 Difference]: With dead ends: 181 [2019-09-05 11:59:40,784 INFO L226 Difference]: Without dead ends: 179 [2019-09-05 11:59:40,785 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-05 11:59:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-05 11:59:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2019-09-05 11:59:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-05 11:59:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-05 11:59:40,793 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 165 [2019-09-05 11:59:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:40,793 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-05 11:59:40,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:59:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-05 11:59:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-05 11:59:40,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:40,795 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:40,795 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash -356085800, now seen corresponding path program 39 times [2019-09-05 11:59:40,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:40,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:40,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:40,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:40,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:41,751 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-05 11:59:41,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:41,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:41,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:41,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-05 11:59:41,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:41,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 11:59:41,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:41,890 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-05 11:59:41,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:41,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-05 11:59:41,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:59:41,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:59:41,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:59:41,896 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2019-09-05 11:59:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:43,171 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2019-09-05 11:59:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 11:59:43,171 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2019-09-05 11:59:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:43,173 INFO L225 Difference]: With dead ends: 247 [2019-09-05 11:59:43,173 INFO L226 Difference]: Without dead ends: 176 [2019-09-05 11:59:43,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1057, Invalid=3365, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 11:59:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-05 11:59:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-05 11:59:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-05 11:59:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-05 11:59:43,184 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 172 [2019-09-05 11:59:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:43,184 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-05 11:59:43,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:59:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-05 11:59:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-05 11:59:43,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:43,186 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:43,186 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:43,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1355042921, now seen corresponding path program 40 times [2019-09-05 11:59:43,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:43,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:43,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:43,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:43,483 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-05 11:59:43,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:43,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:43,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:43,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:43,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:43,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:59:43,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:43,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:43,608 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-05 11:59:43,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:43,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2019-09-05 11:59:43,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:59:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:59:43,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:59:43,612 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 28 states. [2019-09-05 11:59:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:43,798 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2019-09-05 11:59:43,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:59:43,799 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 173 [2019-09-05 11:59:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:43,800 INFO L225 Difference]: With dead ends: 189 [2019-09-05 11:59:43,800 INFO L226 Difference]: Without dead ends: 187 [2019-09-05 11:59:43,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:59:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-05 11:59:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-05 11:59:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-05 11:59:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-09-05 11:59:43,812 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 173 [2019-09-05 11:59:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:43,813 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-09-05 11:59:43,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:59:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-09-05 11:59:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-05 11:59:43,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:43,815 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:43,815 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1998427258, now seen corresponding path program 41 times [2019-09-05 11:59:43,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:43,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:43,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:43,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:43,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:44,846 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-05 11:59:44,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:44,847 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) [2019-09-05 11:59:44,861 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:44,944 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-05 11:59:44,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:44,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:59:44,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:44,986 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-05 11:59:44,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:44,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-05 11:59:44,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:59:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:59:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:59:44,993 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2019-09-05 11:59:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:46,357 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2019-09-05 11:59:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 11:59:46,357 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2019-09-05 11:59:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:46,358 INFO L225 Difference]: With dead ends: 258 [2019-09-05 11:59:46,359 INFO L226 Difference]: Without dead ends: 184 [2019-09-05 11:59:46,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1151, Invalid=3679, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 11:59:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-05 11:59:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-05 11:59:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-05 11:59:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-05 11:59:46,369 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 180 [2019-09-05 11:59:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:46,370 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-05 11:59:46,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:59:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-05 11:59:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-05 11:59:46,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:46,371 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:46,372 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash -568445941, now seen corresponding path program 42 times [2019-09-05 11:59:46,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:46,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:46,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:46,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:46,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:46,844 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-05 11:59:46,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:46,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:46,859 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:46,976 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-05 11:59:46,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:46,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:59:46,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:46,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:47,067 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-05 11:59:47,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:47,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-05 11:59:47,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:59:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:59:47,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:59:47,074 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 29 states. [2019-09-05 11:59:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:47,330 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2019-09-05 11:59:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:59:47,331 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 181 [2019-09-05 11:59:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:47,332 INFO L225 Difference]: With dead ends: 197 [2019-09-05 11:59:47,333 INFO L226 Difference]: Without dead ends: 195 [2019-09-05 11:59:47,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:59:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-05 11:59:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-09-05 11:59:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-05 11:59:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-09-05 11:59:47,343 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 181 [2019-09-05 11:59:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:47,343 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-09-05 11:59:47,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:59:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-09-05 11:59:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-05 11:59:47,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:47,344 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:47,345 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1257027224, now seen corresponding path program 43 times [2019-09-05 11:59:47,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:47,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:47,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:48,077 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-05 11:59:48,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:48,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:48,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:48,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:59:48,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:48,181 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-05 11:59:48,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:48,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-05 11:59:48,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 11:59:48,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 11:59:48,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:59:48,187 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2019-09-05 11:59:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:49,654 INFO L93 Difference]: Finished difference Result 269 states and 293 transitions. [2019-09-05 11:59:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 11:59:49,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2019-09-05 11:59:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:49,657 INFO L225 Difference]: With dead ends: 269 [2019-09-05 11:59:49,657 INFO L226 Difference]: Without dead ends: 192 [2019-09-05 11:59:49,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1249, Invalid=4007, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 11:59:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-05 11:59:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-09-05 11:59:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-05 11:59:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-05 11:59:49,668 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 188 [2019-09-05 11:59:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:49,668 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-05 11:59:49,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 11:59:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-05 11:59:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-05 11:59:49,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:49,669 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:49,670 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 765539625, now seen corresponding path program 44 times [2019-09-05 11:59:49,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:49,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:49,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:49,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:49,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:50,077 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-05 11:59:50,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:50,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:50,090 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-05 11:59:50,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:50,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:50,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 11:59:50,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:50,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:50,221 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-05 11:59:50,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2019-09-05 11:59:50,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:59:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:59:50,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:59:50,226 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 30 states. [2019-09-05 11:59:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:50,485 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2019-09-05 11:59:50,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:59:50,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 189 [2019-09-05 11:59:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:50,490 INFO L225 Difference]: With dead ends: 205 [2019-09-05 11:59:50,490 INFO L226 Difference]: Without dead ends: 203 [2019-09-05 11:59:50,491 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-05 11:59:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-05 11:59:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-05 11:59:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-05 11:59:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-09-05 11:59:50,500 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 189 [2019-09-05 11:59:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:50,501 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-09-05 11:59:50,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:59:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-09-05 11:59:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-05 11:59:50,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:50,502 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:50,502 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 530175930, now seen corresponding path program 45 times [2019-09-05 11:59:50,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:50,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:51,500 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-05 11:59:51,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:51,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:51,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:51,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 11:59:51,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:51,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:59:51,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:51,624 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-05 11:59:51,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:51,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-05 11:59:51,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 11:59:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 11:59:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:59:51,629 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2019-09-05 11:59:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:53,138 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2019-09-05 11:59:53,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 11:59:53,140 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2019-09-05 11:59:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:53,141 INFO L225 Difference]: With dead ends: 280 [2019-09-05 11:59:53,141 INFO L226 Difference]: Without dead ends: 200 [2019-09-05 11:59:53,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1351, Invalid=4349, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 11:59:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-05 11:59:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-09-05 11:59:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-05 11:59:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-05 11:59:53,153 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 196 [2019-09-05 11:59:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:53,153 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-05 11:59:53,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 11:59:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-05 11:59:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-05 11:59:53,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:53,155 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:53,155 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1212992181, now seen corresponding path program 46 times [2019-09-05 11:59:53,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:53,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:53,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:53,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:53,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:53,703 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-05 11:59:53,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:53,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:53,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:53,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:53,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 11:59:53,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:53,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:53,937 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-05 11:59:53,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:53,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-09-05 11:59:53,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:59:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:59:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:59:53,946 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 31 states. [2019-09-05 11:59:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:54,196 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2019-09-05 11:59:54,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:59:54,197 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 197 [2019-09-05 11:59:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:54,198 INFO L225 Difference]: With dead ends: 213 [2019-09-05 11:59:54,199 INFO L226 Difference]: Without dead ends: 211 [2019-09-05 11:59:54,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:59:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-05 11:59:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-09-05 11:59:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-05 11:59:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-09-05 11:59:54,210 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2019-09-05 11:59:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:54,211 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-09-05 11:59:54,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:59:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-09-05 11:59:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-05 11:59:54,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:54,212 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:54,212 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1227869528, now seen corresponding path program 47 times [2019-09-05 11:59:54,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:54,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:54,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:55,021 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-05 11:59:55,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:55,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:55,031 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:55,111 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-05 11:59:55,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:55,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 11:59:55,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:55,180 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-05 11:59:55,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-05 11:59:55,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 11:59:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 11:59:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:59:55,185 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2019-09-05 11:59:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:56,945 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2019-09-05 11:59:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 11:59:56,945 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2019-09-05 11:59:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:56,947 INFO L225 Difference]: With dead ends: 291 [2019-09-05 11:59:56,947 INFO L226 Difference]: Without dead ends: 208 [2019-09-05 11:59:56,948 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-05 11:59:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-05 11:59:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-09-05 11:59:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-05 11:59:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-05 11:59:56,959 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 204 [2019-09-05 11:59:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:56,959 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-05 11:59:56,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 11:59:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-05 11:59:56,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-05 11:59:56,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:56,961 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:56,961 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1889596951, now seen corresponding path program 48 times [2019-09-05 11:59:56,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:56,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:56,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:57,422 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-05 11:59:57,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:57,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:57,436 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-05 11:59:57,536 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 11:59:57,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:57,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 11:59:57,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:57,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:57,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:57,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-05 11:59:57,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:59:57,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:59:57,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:59:57,647 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 32 states. [2019-09-05 11:59:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:57,944 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2019-09-05 11:59:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:59:57,944 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-09-05 11:59:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:57,947 INFO L225 Difference]: With dead ends: 221 [2019-09-05 11:59:57,947 INFO L226 Difference]: Without dead ends: 219 [2019-09-05 11:59:57,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:59:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-05 11:59:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2019-09-05 11:59:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-05 11:59:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-09-05 11:59:57,958 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 205 [2019-09-05 11:59:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:57,958 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-09-05 11:59:57,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:59:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-09-05 11:59:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-05 11:59:57,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:57,960 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:57,960 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash 558312186, now seen corresponding path program 49 times [2019-09-05 11:59:57,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:57,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:59,338 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-05 11:59:59,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:59,339 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) [2019-09-05 11:59:59,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:59,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 11:59:59,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:59,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:59,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-05 11:59:59,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 11:59:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 11:59:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:59:59,475 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2019-09-05 12:00:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:01,327 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2019-09-05 12:00:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 12:00:01,327 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2019-09-05 12:00:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:01,328 INFO L225 Difference]: With dead ends: 302 [2019-09-05 12:00:01,329 INFO L226 Difference]: Without dead ends: 216 [2019-09-05 12:00:01,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1567, Invalid=5075, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:00:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-05 12:00:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-05 12:00:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-05 12:00:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2019-09-05 12:00:01,340 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 212 [2019-09-05 12:00:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:01,341 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2019-09-05 12:00:01,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 12:00:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2019-09-05 12:00:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-05 12:00:01,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:01,342 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:01,343 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash -851622261, now seen corresponding path program 50 times [2019-09-05 12:00:01,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:01,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:01,752 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-05 12:00:01,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:01,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:01,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:01,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:01,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:01,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 12:00:01,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:01,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:01,967 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-05 12:00:01,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:01,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-09-05 12:00:01,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 12:00:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 12:00:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:00:01,973 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 33 states. [2019-09-05 12:00:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:02,306 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2019-09-05 12:00:02,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 12:00:02,307 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 213 [2019-09-05 12:00:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:02,309 INFO L225 Difference]: With dead ends: 229 [2019-09-05 12:00:02,309 INFO L226 Difference]: Without dead ends: 227 [2019-09-05 12:00:02,310 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-05 12:00:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-05 12:00:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-05 12:00:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-05 12:00:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-09-05 12:00:02,322 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 213 [2019-09-05 12:00:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:02,322 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-09-05 12:00:02,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 12:00:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-09-05 12:00:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-05 12:00:02,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:02,324 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:02,324 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1330916328, now seen corresponding path program 51 times [2019-09-05 12:00:02,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:02,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:02,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:04,149 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-05 12:00:04,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:04,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:04,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:04,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-05 12:00:04,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:04,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 12:00:04,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:04,451 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-05 12:00:04,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:04,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-05 12:00:04,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 12:00:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 12:00:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:00:04,460 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2019-09-05 12:00:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:05,527 INFO L93 Difference]: Finished difference Result 313 states and 341 transitions. [2019-09-05 12:00:05,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:00:05,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2019-09-05 12:00:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:05,528 INFO L225 Difference]: With dead ends: 313 [2019-09-05 12:00:05,528 INFO L226 Difference]: Without dead ends: 224 [2019-09-05 12:00:05,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1681, Invalid=5459, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:00:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-05 12:00:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-05 12:00:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-05 12:00:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2019-09-05 12:00:05,541 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 220 [2019-09-05 12:00:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:05,541 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2019-09-05 12:00:05,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 12:00:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2019-09-05 12:00:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-05 12:00:05,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:05,542 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:05,543 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash 957992617, now seen corresponding path program 52 times [2019-09-05 12:00:05,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:05,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:05,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:06,151 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-05 12:00:06,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:06,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:00:06,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:06,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:06,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:06,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 12:00:06,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:06,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:06,329 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-05 12:00:06,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:06,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2019-09-05 12:00:06,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:00:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:00:06,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:00:06,335 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 34 states. [2019-09-05 12:00:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:06,639 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2019-09-05 12:00:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:00:06,640 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 221 [2019-09-05 12:00:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:06,641 INFO L225 Difference]: With dead ends: 237 [2019-09-05 12:00:06,642 INFO L226 Difference]: Without dead ends: 235 [2019-09-05 12:00:06,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:00:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-05 12:00:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-09-05 12:00:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-05 12:00:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-09-05 12:00:06,653 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 221 [2019-09-05 12:00:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:06,653 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-09-05 12:00:06,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:00:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-09-05 12:00:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-05 12:00:06,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:06,655 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:06,655 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1099533882, now seen corresponding path program 53 times [2019-09-05 12:00:06,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:06,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:06,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:08,064 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-05 12:00:08,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:08,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:00:08,078 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-05 12:00:08,193 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-05 12:00:08,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:08,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 12:00:08,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:08,247 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-05 12:00:08,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:08,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-05 12:00:08,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 12:00:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 12:00:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:00:08,252 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2019-09-05 12:00:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:10,399 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions. [2019-09-05 12:00:10,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 12:00:10,399 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2019-09-05 12:00:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:10,400 INFO L225 Difference]: With dead ends: 324 [2019-09-05 12:00:10,400 INFO L226 Difference]: Without dead ends: 232 [2019-09-05 12:00:10,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1799, Invalid=5857, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:00:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-05 12:00:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-05 12:00:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-05 12:00:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2019-09-05 12:00:10,414 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 228 [2019-09-05 12:00:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:10,414 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2019-09-05 12:00:10,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 12:00:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2019-09-05 12:00:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-05 12:00:10,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:10,416 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:10,416 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -601856053, now seen corresponding path program 54 times [2019-09-05 12:00:10,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:10,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:10,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:10,882 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-05 12:00:10,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:10,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:10,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:00:10,981 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-05 12:00:10,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:10,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 12:00:10,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:11,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:11,117 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-05 12:00:11,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:11,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-05 12:00:11,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 12:00:11,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 12:00:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:00:11,123 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 35 states. [2019-09-05 12:00:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:11,462 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2019-09-05 12:00:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:00:11,463 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2019-09-05 12:00:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:11,465 INFO L225 Difference]: With dead ends: 245 [2019-09-05 12:00:11,466 INFO L226 Difference]: Without dead ends: 243 [2019-09-05 12:00:11,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:00:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-05 12:00:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-09-05 12:00:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-05 12:00:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-09-05 12:00:11,477 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 229 [2019-09-05 12:00:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:11,477 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-09-05 12:00:11,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 12:00:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-09-05 12:00:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-05 12:00:11,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:11,479 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:11,479 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1417884968, now seen corresponding path program 55 times [2019-09-05 12:00:11,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:11,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:11,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:11,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:11,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:12,532 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-05 12:00:12,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:12,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:12,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:12,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 12:00:12,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:00:12,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:12,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-05 12:00:12,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-05 12:00:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-05 12:00:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:00:12,670 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2019-09-05 12:00:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:14,963 INFO L93 Difference]: Finished difference Result 335 states and 365 transitions. [2019-09-05 12:00:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 12:00:14,964 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2019-09-05 12:00:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:14,965 INFO L225 Difference]: With dead ends: 335 [2019-09-05 12:00:14,965 INFO L226 Difference]: Without dead ends: 240 [2019-09-05 12:00:14,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1921, Invalid=6269, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:00:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-05 12:00:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-05 12:00:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-05 12:00:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2019-09-05 12:00:14,978 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 236 [2019-09-05 12:00:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:14,978 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2019-09-05 12:00:14,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-05 12:00:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2019-09-05 12:00:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-05 12:00:14,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:14,980 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:14,980 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1290634089, now seen corresponding path program 56 times [2019-09-05 12:00:14,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:15,465 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-05 12:00:15,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:15,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:15,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:15,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:15,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:15,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-05 12:00:15,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:15,654 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-05 12:00:15,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:15,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2019-09-05 12:00:15,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:00:15,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:00:15,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 12:00:15,658 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 36 states. [2019-09-05 12:00:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:15,930 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2019-09-05 12:00:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:00:15,931 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 237 [2019-09-05 12:00:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:15,933 INFO L225 Difference]: With dead ends: 253 [2019-09-05 12:00:15,933 INFO L226 Difference]: Without dead ends: 251 [2019-09-05 12:00:15,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:00:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-05 12:00:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2019-09-05 12:00:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-05 12:00:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2019-09-05 12:00:15,945 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2019-09-05 12:00:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:15,945 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2019-09-05 12:00:15,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:00:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2019-09-05 12:00:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-05 12:00:15,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:15,947 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:15,947 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 113574266, now seen corresponding path program 57 times [2019-09-05 12:00:15,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:15,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:17,102 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-05 12:00:17,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:17,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:17,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:17,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-05 12:00:17,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:17,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 12:00:17,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:00:17,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:17,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-05 12:00:17,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 12:00:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 12:00:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:00:17,295 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2019-09-05 12:00:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:19,702 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2019-09-05 12:00:19,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 12:00:19,702 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2019-09-05 12:00:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:19,704 INFO L225 Difference]: With dead ends: 346 [2019-09-05 12:00:19,704 INFO L226 Difference]: Without dead ends: 248 [2019-09-05 12:00:19,705 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-05 12:00:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-05 12:00:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-09-05 12:00:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-05 12:00:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2019-09-05 12:00:19,718 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 244 [2019-09-05 12:00:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:19,718 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2019-09-05 12:00:19,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 12:00:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2019-09-05 12:00:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-05 12:00:19,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:19,720 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:19,720 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1656789259, now seen corresponding path program 58 times [2019-09-05 12:00:19,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:19,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:20,212 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-05 12:00:20,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:20,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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:20,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:20,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:20,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:20,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-05 12:00:20,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (59)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:00:20,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:20,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-09-05 12:00:20,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:00:20,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:00:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:00:20,421 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 37 states. [2019-09-05 12:00:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:20,830 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2019-09-05 12:00:20,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 12:00:20,830 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 245 [2019-09-05 12:00:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:20,832 INFO L225 Difference]: With dead ends: 261 [2019-09-05 12:00:20,832 INFO L226 Difference]: Without dead ends: 259 [2019-09-05 12:00:20,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:00:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-05 12:00:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-05 12:00:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-05 12:00:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-09-05 12:00:20,846 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 245 [2019-09-05 12:00:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:20,846 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2019-09-05 12:00:20,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:00:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2019-09-05 12:00:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-05 12:00:20,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:20,848 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:20,848 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2101431912, now seen corresponding path program 59 times [2019-09-05 12:00:20,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:20,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:20,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:20,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:20,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:22,091 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-05 12:00:22,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:22,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:22,101 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:00:22,221 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-05 12:00:22,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:22,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-05 12:00:22,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:22,281 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-05 12:00:22,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:22,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-05 12:00:22,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 12:00:22,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 12:00:22,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:00:22,287 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2019-09-05 12:00:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:24,857 INFO L93 Difference]: Finished difference Result 357 states and 389 transitions. [2019-09-05 12:00:24,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 12:00:24,857 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-05 12:00:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:24,858 INFO L225 Difference]: With dead ends: 357 [2019-09-05 12:00:24,859 INFO L226 Difference]: Without dead ends: 256 [2019-09-05 12:00:24,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2177, Invalid=7135, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:00:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-05 12:00:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-09-05 12:00:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-05 12:00:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2019-09-05 12:00:24,868 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 252 [2019-09-05 12:00:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:24,869 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2019-09-05 12:00:24,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 12:00:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2019-09-05 12:00:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-05 12:00:24,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:24,871 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:24,871 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:24,871 INFO L82 PathProgramCache]: Analyzing trace with hash 200681513, now seen corresponding path program 60 times [2019-09-05 12:00:24,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:24,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:24,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:24,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:24,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:25,444 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-05 12:00:25,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:25,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:25,455 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:00:25,555 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 12:00:25,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:25,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 12:00:25,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:25,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:25,630 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-05 12:00:25,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:25,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-05 12:00:25,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 12:00:25,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 12:00:25,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:00:25,635 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2019-09-05 12:00:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:26,027 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2019-09-05 12:00:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:00:26,027 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-09-05 12:00:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:26,029 INFO L225 Difference]: With dead ends: 269 [2019-09-05 12:00:26,029 INFO L226 Difference]: Without dead ends: 267 [2019-09-05 12:00:26,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:00:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-05 12:00:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-05 12:00:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-05 12:00:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2019-09-05 12:00:26,043 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2019-09-05 12:00:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:26,043 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2019-09-05 12:00:26,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 12:00:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2019-09-05 12:00:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-05 12:00:26,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:26,045 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:26,046 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:26,046 INFO L82 PathProgramCache]: Analyzing trace with hash -128088902, now seen corresponding path program 61 times [2019-09-05 12:00:26,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:26,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:26,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:26,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:27,411 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-05 12:00:27,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:27,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:27,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:27,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-05 12:00:27,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:27,542 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-05 12:00:27,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:27,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-05 12:00:27,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 12:00:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 12:00:27,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:00:27,546 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2019-09-05 12:00:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:28,863 INFO L93 Difference]: Finished difference Result 368 states and 401 transitions. [2019-09-05 12:00:28,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-05 12:00:28,863 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2019-09-05 12:00:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:28,865 INFO L225 Difference]: With dead ends: 368 [2019-09-05 12:00:28,865 INFO L226 Difference]: Without dead ends: 264 [2019-09-05 12:00:28,866 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-05 12:00:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-05 12:00:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-09-05 12:00:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-05 12:00:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2019-09-05 12:00:28,879 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 260 [2019-09-05 12:00:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:28,879 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2019-09-05 12:00:28,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 12:00:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2019-09-05 12:00:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-05 12:00:28,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:28,881 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:28,881 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash -528360885, now seen corresponding path program 62 times [2019-09-05 12:00:28,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:28,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:29,467 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-05 12:00:29,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:29,468 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) [2019-09-05 12:00:29,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:29,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:29,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:29,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 12:00:29,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:29,634 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-05 12:00:29,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:29,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-09-05 12:00:29,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 12:00:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 12:00:29,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:00:29,639 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 39 states. [2019-09-05 12:00:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:29,965 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2019-09-05 12:00:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 12:00:29,966 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-09-05 12:00:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:29,968 INFO L225 Difference]: With dead ends: 277 [2019-09-05 12:00:29,968 INFO L226 Difference]: Without dead ends: 275 [2019-09-05 12:00:29,969 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-05 12:00:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-05 12:00:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2019-09-05 12:00:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-05 12:00:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2019-09-05 12:00:29,980 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 261 [2019-09-05 12:00:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:29,980 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2019-09-05 12:00:29,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 12:00:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2019-09-05 12:00:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-05 12:00:29,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:29,982 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:29,982 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:29,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1586333784, now seen corresponding path program 63 times [2019-09-05 12:00:29,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:29,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:29,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:29,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:31,336 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-05 12:00:31,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:31,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:31,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-05 12:00:31,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:31,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 12:00:31,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:31,515 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-05 12:00:31,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:31,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-05 12:00:31,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-05 12:00:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-05 12:00:31,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:00:31,520 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2019-09-05 12:00:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:34,391 INFO L93 Difference]: Finished difference Result 379 states and 413 transitions. [2019-09-05 12:00:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 12:00:34,392 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2019-09-05 12:00:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:34,393 INFO L225 Difference]: With dead ends: 379 [2019-09-05 12:00:34,394 INFO L226 Difference]: Without dead ends: 272 [2019-09-05 12:00:34,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2449, Invalid=8057, Unknown=0, NotChecked=0, Total=10506 [2019-09-05 12:00:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-05 12:00:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-05 12:00:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-05 12:00:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 273 transitions. [2019-09-05 12:00:34,408 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 273 transitions. Word has length 268 [2019-09-05 12:00:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:34,409 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 273 transitions. [2019-09-05 12:00:34,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-05 12:00:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 273 transitions. [2019-09-05 12:00:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-05 12:00:34,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:34,411 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:34,411 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1773159191, now seen corresponding path program 64 times [2019-09-05 12:00:34,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:34,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:34,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:34,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:35,022 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-05 12:00:35,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:35,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:35,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:35,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:35,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:35,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-05 12:00:35,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:35,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:35,250 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-05 12:00:35,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:35,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2019-09-05 12:00:35,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 12:00:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 12:00:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:00:35,256 INFO L87 Difference]: Start difference. First operand 272 states and 273 transitions. Second operand 40 states. [2019-09-05 12:00:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:35,578 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2019-09-05 12:00:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:00:35,578 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-05 12:00:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:35,580 INFO L225 Difference]: With dead ends: 285 [2019-09-05 12:00:35,580 INFO L226 Difference]: Without dead ends: 283 [2019-09-05 12:00:35,580 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-05 12:00:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-05 12:00:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2019-09-05 12:00:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-05 12:00:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2019-09-05 12:00:35,593 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 269 [2019-09-05 12:00:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:35,594 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2019-09-05 12:00:35,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 12:00:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2019-09-05 12:00:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-05 12:00:35,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:35,596 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:35,596 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash -558426118, now seen corresponding path program 65 times [2019-09-05 12:00:35,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:35,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:35,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:35,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:35,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:37,160 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-05 12:00:37,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:37,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:37,170 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:00:37,275 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-05 12:00:37,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:37,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 12:00:37,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:37,322 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-05 12:00:37,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:37,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-05 12:00:37,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 12:00:37,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 12:00:37,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:00:37,327 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2019-09-05 12:00:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:40,404 INFO L93 Difference]: Finished difference Result 390 states and 425 transitions. [2019-09-05 12:00:40,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 12:00:40,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2019-09-05 12:00:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:40,410 INFO L225 Difference]: With dead ends: 390 [2019-09-05 12:00:40,410 INFO L226 Difference]: Without dead ends: 280 [2019-09-05 12:00:40,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2591, Invalid=8539, Unknown=0, NotChecked=0, Total=11130 [2019-09-05 12:00:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-05 12:00:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-05 12:00:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-05 12:00:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2019-09-05 12:00:40,424 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 276 [2019-09-05 12:00:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:40,424 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2019-09-05 12:00:40,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 12:00:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2019-09-05 12:00:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-05 12:00:40,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:40,426 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:40,426 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:40,426 INFO L82 PathProgramCache]: Analyzing trace with hash 365439883, now seen corresponding path program 66 times [2019-09-05 12:00:40,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:40,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:40,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:40,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:41,014 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-05 12:00:41,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:41,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:41,024 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:00:41,138 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-05 12:00:41,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:41,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 12:00:41,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:41,221 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-05 12:00:41,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:41,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-05 12:00:41,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 12:00:41,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 12:00:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:00:41,226 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 41 states. [2019-09-05 12:00:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:41,639 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2019-09-05 12:00:41,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 12:00:41,639 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 277 [2019-09-05 12:00:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:41,641 INFO L225 Difference]: With dead ends: 293 [2019-09-05 12:00:41,641 INFO L226 Difference]: Without dead ends: 291 [2019-09-05 12:00:41,642 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-05 12:00:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-05 12:00:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2019-09-05 12:00:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-05 12:00:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2019-09-05 12:00:41,656 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 277 [2019-09-05 12:00:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:41,656 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2019-09-05 12:00:41,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 12:00:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2019-09-05 12:00:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-05 12:00:41,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:41,658 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:41,658 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash 101011224, now seen corresponding path program 67 times [2019-09-05 12:00:41,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:41,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:41,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:41,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:41,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:43,132 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-05 12:00:43,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:43,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:43,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:43,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-05 12:00:43,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:43,279 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-05 12:00:43,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:43,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-05 12:00:43,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-05 12:00:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-05 12:00:43,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:00:43,284 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2019-09-05 12:00:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:45,590 INFO L93 Difference]: Finished difference Result 401 states and 437 transitions. [2019-09-05 12:00:45,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 12:00:45,591 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2019-09-05 12:00:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:45,592 INFO L225 Difference]: With dead ends: 401 [2019-09-05 12:00:45,592 INFO L226 Difference]: Without dead ends: 288 [2019-09-05 12:00:45,593 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-05 12:00:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-05 12:00:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-05 12:00:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-05 12:00:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2019-09-05 12:00:45,606 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 284 [2019-09-05 12:00:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:45,606 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2019-09-05 12:00:45,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-05 12:00:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2019-09-05 12:00:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-05 12:00:45,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:45,608 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:45,608 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1424604759, now seen corresponding path program 68 times [2019-09-05 12:00:45,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:45,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:45,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:46,327 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-05 12:00:46,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:46,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:46,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:46,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:46,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:46,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 12:00:46,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:46,567 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-05 12:00:46,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:46,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2019-09-05 12:00:46,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 12:00:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 12:00:46,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:00:46,573 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 42 states. [2019-09-05 12:00:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:46,998 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2019-09-05 12:00:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 12:00:46,999 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 285 [2019-09-05 12:00:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:47,001 INFO L225 Difference]: With dead ends: 301 [2019-09-05 12:00:47,001 INFO L226 Difference]: Without dead ends: 299 [2019-09-05 12:00:47,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:00:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-05 12:00:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2019-09-05 12:00:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-05 12:00:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-09-05 12:00:47,015 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2019-09-05 12:00:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:47,016 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-09-05 12:00:47,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 12:00:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-09-05 12:00:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-05 12:00:47,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:47,018 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:47,018 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash 53852986, now seen corresponding path program 69 times [2019-09-05 12:00:47,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:47,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:47,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:47,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:47,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:48,572 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-05 12:00:48,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:48,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:48,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:48,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-05 12:00:48,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:48,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 12:00:48,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:48,778 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-05 12:00:48,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:48,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-05 12:00:48,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 12:00:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 12:00:48,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 12:00:48,783 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2019-09-05 12:00:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:51,211 INFO L93 Difference]: Finished difference Result 412 states and 449 transitions. [2019-09-05 12:00:51,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 12:00:51,212 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2019-09-05 12:00:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:51,213 INFO L225 Difference]: With dead ends: 412 [2019-09-05 12:00:51,213 INFO L226 Difference]: Without dead ends: 296 [2019-09-05 12:00:51,214 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-05 12:00:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-05 12:00:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-05 12:00:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-05 12:00:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2019-09-05 12:00:51,228 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 292 [2019-09-05 12:00:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:51,228 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2019-09-05 12:00:51,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 12:00:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2019-09-05 12:00:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-05 12:00:51,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:51,229 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:51,229 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:51,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1140296907, now seen corresponding path program 70 times [2019-09-05 12:00:51,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:51,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:51,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:52,010 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-05 12:00:52,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:52,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:52,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:52,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:52,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:52,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 12:00:52,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:52,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:52,220 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-05 12:00:52,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:52,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-09-05 12:00:52,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 12:00:52,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 12:00:52,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:00:52,225 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 43 states. [2019-09-05 12:00:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:52,679 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2019-09-05 12:00:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 12:00:52,679 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 293 [2019-09-05 12:00:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:52,682 INFO L225 Difference]: With dead ends: 309 [2019-09-05 12:00:52,682 INFO L226 Difference]: Without dead ends: 307 [2019-09-05 12:00:52,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:00:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-05 12:00:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-05 12:00:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-05 12:00:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2019-09-05 12:00:52,698 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 293 [2019-09-05 12:00:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:52,698 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2019-09-05 12:00:52,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 12:00:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2019-09-05 12:00:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-05 12:00:52,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:52,700 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:52,700 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1623063080, now seen corresponding path program 71 times [2019-09-05 12:00:52,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:52,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:52,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:54,332 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-05 12:00:54,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:54,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:54,343 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:00:54,466 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-05 12:00:54,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:54,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 12:00:54,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (72)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:00:54,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:54,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-05 12:00:54,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 12:00:54,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 12:00:54,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:00:54,574 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2019-09-05 12:00:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:57,290 INFO L93 Difference]: Finished difference Result 423 states and 461 transitions. [2019-09-05 12:00:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 12:00:57,291 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2019-09-05 12:00:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:57,293 INFO L225 Difference]: With dead ends: 423 [2019-09-05 12:00:57,293 INFO L226 Difference]: Without dead ends: 304 [2019-09-05 12:00:57,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3041, Invalid=10069, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:00:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-05 12:00:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-05 12:00:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-05 12:00:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2019-09-05 12:00:57,311 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 300 [2019-09-05 12:00:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:57,311 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2019-09-05 12:00:57,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 12:00:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2019-09-05 12:00:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-05 12:00:57,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:57,313 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:57,313 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1751496297, now seen corresponding path program 72 times [2019-09-05 12:00:57,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:57,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:57,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:57,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:57,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:58,001 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-05 12:00:58,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:58,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:58,011 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:00:58,166 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-05 12:00:58,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:58,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-05 12:00:58,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:58,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:58,278 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-05 12:00:58,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:58,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-05 12:00:58,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 12:00:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 12:00:58,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:00:58,284 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 44 states. [2019-09-05 12:00:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:58,696 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2019-09-05 12:00:58,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 12:00:58,697 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 301 [2019-09-05 12:00:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:58,699 INFO L225 Difference]: With dead ends: 317 [2019-09-05 12:00:58,699 INFO L226 Difference]: Without dead ends: 315 [2019-09-05 12:00:58,700 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-05 12:00:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-05 12:00:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-09-05 12:00:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-05 12:00:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2019-09-05 12:00:58,710 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 301 [2019-09-05 12:00:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:58,711 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2019-09-05 12:00:58,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 12:00:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2019-09-05 12:00:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-05 12:00:58,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:58,713 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:58,713 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1883074170, now seen corresponding path program 73 times [2019-09-05 12:00:58,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:58,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:58,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:58,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:00,470 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-05 12:01:00,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:00,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:00,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 12:01:00,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:00,650 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-05 12:01:00,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:00,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-05 12:01:00,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 12:01:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 12:01:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:01:00,655 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2019-09-05 12:01:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:03,310 INFO L93 Difference]: Finished difference Result 434 states and 473 transitions. [2019-09-05 12:01:03,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 12:01:03,311 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2019-09-05 12:01:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:03,312 INFO L225 Difference]: With dead ends: 434 [2019-09-05 12:01:03,312 INFO L226 Difference]: Without dead ends: 312 [2019-09-05 12:01:03,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3199, Invalid=10607, Unknown=0, NotChecked=0, Total=13806 [2019-09-05 12:01:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-05 12:01:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-09-05 12:01:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-05 12:01:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2019-09-05 12:01:03,324 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 308 [2019-09-05 12:01:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:03,324 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2019-09-05 12:01:03,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 12:01:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2019-09-05 12:01:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-05 12:01:03,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:03,325 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:03,325 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:03,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1836318219, now seen corresponding path program 74 times [2019-09-05 12:01:03,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:03,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:03,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:04,029 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-05 12:01:04,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:04,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:04,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:04,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:04,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:04,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-05 12:01:04,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:04,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:04,226 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-05 12:01:04,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:04,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-09-05 12:01:04,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 12:01:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 12:01:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:01:04,231 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 45 states. [2019-09-05 12:01:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:04,625 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2019-09-05 12:01:04,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 12:01:04,625 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 309 [2019-09-05 12:01:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:04,627 INFO L225 Difference]: With dead ends: 325 [2019-09-05 12:01:04,627 INFO L226 Difference]: Without dead ends: 323 [2019-09-05 12:01:04,627 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-05 12:01:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-05 12:01:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-09-05 12:01:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-05 12:01:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2019-09-05 12:01:04,639 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 309 [2019-09-05 12:01:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:04,639 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2019-09-05 12:01:04,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 12:01:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2019-09-05 12:01:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-05 12:01:04,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:04,642 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:04,642 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1868541080, now seen corresponding path program 75 times [2019-09-05 12:01:04,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:04,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:04,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:06,520 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-05 12:01:06,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:06,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:06,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:06,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-05 12:01:06,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:06,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-05 12:01:06,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:06,752 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-05 12:01:06,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:06,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-05 12:01:06,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 12:01:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 12:01:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:01:06,758 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2019-09-05 12:01:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:09,685 INFO L93 Difference]: Finished difference Result 445 states and 485 transitions. [2019-09-05 12:01:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 12:01:09,688 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2019-09-05 12:01:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:09,690 INFO L225 Difference]: With dead ends: 445 [2019-09-05 12:01:09,690 INFO L226 Difference]: Without dead ends: 320 [2019-09-05 12:01:09,692 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-05 12:01:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-05 12:01:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-05 12:01:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-05 12:01:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2019-09-05 12:01:09,708 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 316 [2019-09-05 12:01:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:09,708 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2019-09-05 12:01:09,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 12:01:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2019-09-05 12:01:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-05 12:01:09,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:09,711 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:09,711 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash 190454569, now seen corresponding path program 76 times [2019-09-05 12:01:09,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:09,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:09,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:10,451 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-05 12:01:10,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:10,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:10,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:10,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:10,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:10,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 12:01:10,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:10,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:10,675 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-05 12:01:10,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:10,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2019-09-05 12:01:10,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 12:01:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 12:01:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:01:10,681 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 46 states. [2019-09-05 12:01:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:11,161 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2019-09-05 12:01:11,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 12:01:11,161 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 317 [2019-09-05 12:01:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:11,163 INFO L225 Difference]: With dead ends: 333 [2019-09-05 12:01:11,163 INFO L226 Difference]: Without dead ends: 331 [2019-09-05 12:01:11,164 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-05 12:01:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-05 12:01:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-09-05 12:01:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-05 12:01:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2019-09-05 12:01:11,175 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 317 [2019-09-05 12:01:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:11,175 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2019-09-05 12:01:11,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 12:01:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2019-09-05 12:01:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-05 12:01:11,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:11,176 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:11,177 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash 825373114, now seen corresponding path program 77 times [2019-09-05 12:01:11,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:11,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:11,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:13,042 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-05 12:01:13,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:13,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:13,052 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:13,187 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-05 12:01:13,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:13,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-05 12:01:13,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:13,253 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-05 12:01:13,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-05 12:01:13,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 12:01:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 12:01:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:01:13,258 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2019-09-05 12:01:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:15,309 INFO L93 Difference]: Finished difference Result 456 states and 497 transitions. [2019-09-05 12:01:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 12:01:15,310 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2019-09-05 12:01:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:15,312 INFO L225 Difference]: With dead ends: 456 [2019-09-05 12:01:15,312 INFO L226 Difference]: Without dead ends: 328 [2019-09-05 12:01:15,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3527, Invalid=11725, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:01:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-05 12:01:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-09-05 12:01:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-05 12:01:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2019-09-05 12:01:15,330 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 324 [2019-09-05 12:01:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:15,330 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2019-09-05 12:01:15,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 12:01:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2019-09-05 12:01:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-05 12:01:15,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:15,332 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:15,333 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1784578229, now seen corresponding path program 78 times [2019-09-05 12:01:15,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:15,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:15,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:15,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:15,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:16,146 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-05 12:01:16,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:16,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:16,156 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:16,300 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-09-05 12:01:16,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:16,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 12:01:16,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:16,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:16,398 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-05 12:01:16,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:16,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-05 12:01:16,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 12:01:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 12:01:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:01:16,404 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 47 states. [2019-09-05 12:01:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:16,796 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2019-09-05 12:01:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 12:01:16,797 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 325 [2019-09-05 12:01:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:16,799 INFO L225 Difference]: With dead ends: 341 [2019-09-05 12:01:16,799 INFO L226 Difference]: Without dead ends: 339 [2019-09-05 12:01:16,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:01:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-05 12:01:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2019-09-05 12:01:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-05 12:01:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2019-09-05 12:01:16,813 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 325 [2019-09-05 12:01:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:16,813 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2019-09-05 12:01:16,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 12:01:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2019-09-05 12:01:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-05 12:01:16,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:16,815 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:16,816 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1703263400, now seen corresponding path program 79 times [2019-09-05 12:01:16,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:16,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:16,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:18,771 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-05 12:01:18,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:18,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:18,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:18,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 12:01:18,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:18,973 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-05 12:01:18,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:18,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-05 12:01:18,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 12:01:18,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 12:01:18,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:01:18,979 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2019-09-05 12:01:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:21,575 INFO L93 Difference]: Finished difference Result 467 states and 509 transitions. [2019-09-05 12:01:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 12:01:21,575 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2019-09-05 12:01:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:21,576 INFO L225 Difference]: With dead ends: 467 [2019-09-05 12:01:21,576 INFO L226 Difference]: Without dead ends: 336 [2019-09-05 12:01:21,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3697, Invalid=12305, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:01:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-05 12:01:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-05 12:01:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-05 12:01:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2019-09-05 12:01:21,588 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 332 [2019-09-05 12:01:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:21,588 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2019-09-05 12:01:21,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 12:01:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2019-09-05 12:01:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-05 12:01:21,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:21,589 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:21,590 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1341165591, now seen corresponding path program 80 times [2019-09-05 12:01:21,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:21,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:21,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:21,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:22,425 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-05 12:01:22,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:22,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:22,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:22,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:22,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:22,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-05 12:01:22,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:22,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:22,634 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-05 12:01:22,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:22,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2019-09-05 12:01:22,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 12:01:22,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 12:01:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:01:22,639 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 48 states. [2019-09-05 12:01:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:23,151 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2019-09-05 12:01:23,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 12:01:23,152 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 333 [2019-09-05 12:01:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:23,154 INFO L225 Difference]: With dead ends: 349 [2019-09-05 12:01:23,154 INFO L226 Difference]: Without dead ends: 347 [2019-09-05 12:01:23,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:01:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-05 12:01:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-05 12:01:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-05 12:01:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2019-09-05 12:01:23,173 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2019-09-05 12:01:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:23,174 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2019-09-05 12:01:23,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 12:01:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2019-09-05 12:01:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-05 12:01:23,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:23,175 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:23,175 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628166, now seen corresponding path program 81 times [2019-09-05 12:01:23,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:23,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:23,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:25,220 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-05 12:01:25,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:25,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:25,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:25,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-05 12:01:25,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:25,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 12:01:25,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:25,499 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-05 12:01:25,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:25,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-05 12:01:25,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-05 12:01:25,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-05 12:01:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:01:25,506 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2019-09-05 12:01:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:27,893 INFO L93 Difference]: Finished difference Result 478 states and 521 transitions. [2019-09-05 12:01:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 12:01:27,893 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2019-09-05 12:01:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:27,894 INFO L225 Difference]: With dead ends: 478 [2019-09-05 12:01:27,895 INFO L226 Difference]: Without dead ends: 344 [2019-09-05 12:01:27,896 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-05 12:01:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-05 12:01:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-09-05 12:01:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-05 12:01:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-09-05 12:01:27,914 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 340 [2019-09-05 12:01:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:27,914 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-09-05 12:01:27,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-05 12:01:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-09-05 12:01:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-05 12:01:27,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:27,916 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:27,916 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash 14946443, now seen corresponding path program 82 times [2019-09-05 12:01:27,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:27,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:28,736 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-05 12:01:28,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:28,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:28,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:28,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:28,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:28,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 12:01:28,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:28,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:28,976 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-05 12:01:28,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:28,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-09-05 12:01:28,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 12:01:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 12:01:28,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:01:28,981 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 49 states. [2019-09-05 12:01:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:29,466 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2019-09-05 12:01:29,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 12:01:29,467 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 341 [2019-09-05 12:01:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:29,469 INFO L225 Difference]: With dead ends: 357 [2019-09-05 12:01:29,469 INFO L226 Difference]: Without dead ends: 355 [2019-09-05 12:01:29,469 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-05 12:01:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-05 12:01:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2019-09-05 12:01:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-05 12:01:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2019-09-05 12:01:29,481 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 341 [2019-09-05 12:01:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:29,481 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2019-09-05 12:01:29,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 12:01:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2019-09-05 12:01:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-05 12:01:29,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:29,483 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:29,483 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash -475149800, now seen corresponding path program 83 times [2019-09-05 12:01:29,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:29,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:29,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:31,599 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-05 12:01:31,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:31,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:31,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:31,758 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-05 12:01:31,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:31,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-05 12:01:31,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (84)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:01:31,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:31,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-05 12:01:31,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 12:01:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 12:01:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1981, Invalid=5851, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:01:31,869 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2019-09-05 12:01:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:36,601 INFO L93 Difference]: Finished difference Result 489 states and 533 transitions. [2019-09-05 12:01:36,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 12:01:36,601 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2019-09-05 12:01:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:36,603 INFO L225 Difference]: With dead ends: 489 [2019-09-05 12:01:36,603 INFO L226 Difference]: Without dead ends: 352 [2019-09-05 12:01:36,604 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-05 12:01:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-05 12:01:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-05 12:01:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-05 12:01:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2019-09-05 12:01:36,616 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 348 [2019-09-05 12:01:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:36,616 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2019-09-05 12:01:36,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 12:01:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2019-09-05 12:01:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-05 12:01:36,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:36,618 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:36,618 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:36,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:36,619 INFO L82 PathProgramCache]: Analyzing trace with hash 295810217, now seen corresponding path program 84 times [2019-09-05 12:01:36,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:36,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:36,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:37,485 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-05 12:01:37,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:37,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:37,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:37,693 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-05 12:01:37,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:37,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 12:01:37,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:37,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:37,867 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-05 12:01:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:37,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-05 12:01:37,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 12:01:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 12:01:37,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:01:37,875 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 50 states. [2019-09-05 12:01:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:38,378 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2019-09-05 12:01:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 12:01:38,379 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 349 [2019-09-05 12:01:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:38,381 INFO L225 Difference]: With dead ends: 365 [2019-09-05 12:01:38,381 INFO L226 Difference]: Without dead ends: 363 [2019-09-05 12:01:38,382 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-05 12:01:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-05 12:01:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2019-09-05 12:01:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-05 12:01:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2019-09-05 12:01:38,394 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2019-09-05 12:01:38,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:38,394 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2019-09-05 12:01:38,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 12:01:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2019-09-05 12:01:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-05 12:01:38,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:38,396 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:38,396 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1634920506, now seen corresponding path program 85 times [2019-09-05 12:01:38,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:38,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:38,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:38,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:40,625 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-05 12:01:40,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:40,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:40,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 12:01:40,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:40,816 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-05 12:01:40,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:40,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-05 12:01:40,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 12:01:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 12:01:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:01:40,822 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2019-09-05 12:01:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:44,329 INFO L93 Difference]: Finished difference Result 500 states and 545 transitions. [2019-09-05 12:01:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 12:01:44,329 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2019-09-05 12:01:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:44,331 INFO L225 Difference]: With dead ends: 500 [2019-09-05 12:01:44,331 INFO L226 Difference]: Without dead ends: 360 [2019-09-05 12:01:44,332 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-05 12:01:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-05 12:01:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-09-05 12:01:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-05 12:01:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2019-09-05 12:01:44,345 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 356 [2019-09-05 12:01:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:44,345 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2019-09-05 12:01:44,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 12:01:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2019-09-05 12:01:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-05 12:01:44,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:44,348 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:44,348 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1956622795, now seen corresponding path program 86 times [2019-09-05 12:01:44,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:44,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:44,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:44,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:44,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:45,428 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-05 12:01:45,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:45,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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:45,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:45,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:45,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:45,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 12:01:45,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:45,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:45,691 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-05 12:01:45,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:45,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-09-05 12:01:45,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 12:01:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 12:01:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:01:45,695 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 51 states. [2019-09-05 12:01:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:46,154 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2019-09-05 12:01:46,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-05 12:01:46,155 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 357 [2019-09-05 12:01:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:46,157 INFO L225 Difference]: With dead ends: 373 [2019-09-05 12:01:46,157 INFO L226 Difference]: Without dead ends: 371 [2019-09-05 12:01:46,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:01:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-05 12:01:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2019-09-05 12:01:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-05 12:01:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2019-09-05 12:01:46,170 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 357 [2019-09-05 12:01:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:46,170 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2019-09-05 12:01:46,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 12:01:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2019-09-05 12:01:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-05 12:01:46,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:46,172 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:46,172 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1830174936, now seen corresponding path program 87 times [2019-09-05 12:01:46,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:46,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:46,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:48,450 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-05 12:01:48,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:48,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:48,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:48,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-05 12:01:48,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:48,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 12:01:48,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:48,738 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-05 12:01:48,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:48,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-05 12:01:48,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 12:01:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 12:01:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2163, Invalid=6393, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:01:48,744 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 93 states. [2019-09-05 12:01:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:52,522 INFO L93 Difference]: Finished difference Result 511 states and 557 transitions. [2019-09-05 12:01:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 12:01:52,523 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2019-09-05 12:01:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:52,524 INFO L225 Difference]: With dead ends: 511 [2019-09-05 12:01:52,524 INFO L226 Difference]: Without dead ends: 368 [2019-09-05 12:01:52,525 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-05 12:01:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-05 12:01:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-09-05 12:01:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-05 12:01:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2019-09-05 12:01:52,540 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 364 [2019-09-05 12:01:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:52,540 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2019-09-05 12:01:52,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 12:01:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2019-09-05 12:01:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-05 12:01:52,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:52,543 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:52,543 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1244457321, now seen corresponding path program 88 times [2019-09-05 12:01:52,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:53,442 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-05 12:01:53,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:53,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:53,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:53,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:53,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 12:01:53,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:53,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (89)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:01:53,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:53,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 52 [2019-09-05 12:01:53,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 12:01:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 12:01:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:01:53,807 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 52 states. [2019-09-05 12:01:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:54,236 INFO L93 Difference]: Finished difference Result 381 states and 383 transitions. [2019-09-05 12:01:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 12:01:54,236 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 365 [2019-09-05 12:01:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:54,239 INFO L225 Difference]: With dead ends: 381 [2019-09-05 12:01:54,239 INFO L226 Difference]: Without dead ends: 379 [2019-09-05 12:01:54,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:01:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-05 12:01:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2019-09-05 12:01:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-05 12:01:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2019-09-05 12:01:54,259 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 365 [2019-09-05 12:01:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:54,259 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2019-09-05 12:01:54,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 12:01:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2019-09-05 12:01:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-05 12:01:54,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:54,262 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:54,262 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash 747035514, now seen corresponding path program 89 times [2019-09-05 12:01:54,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:54,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:54,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:54,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:54,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:56,930 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-05 12:01:56,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:56,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:56,940 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:57,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-05 12:01:57,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:57,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 12:01:57,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:57,204 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-05 12:01:57,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:57,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-05 12:01:57,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 12:01:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 12:01:57,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:01:57,210 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 95 states. [2019-09-05 12:02:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:00,146 INFO L93 Difference]: Finished difference Result 522 states and 569 transitions. [2019-09-05 12:02:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 12:02:00,147 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2019-09-05 12:02:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:00,148 INFO L225 Difference]: With dead ends: 522 [2019-09-05 12:02:00,148 INFO L226 Difference]: Without dead ends: 376 [2019-09-05 12:02:00,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4607, Invalid=15415, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:02:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-05 12:02:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-09-05 12:02:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-05 12:02:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-09-05 12:02:00,166 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 372 [2019-09-05 12:02:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:00,167 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2019-09-05 12:02:00,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 12:02:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2019-09-05 12:02:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-05 12:02:00,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:00,168 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:00,169 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2000184075, now seen corresponding path program 90 times [2019-09-05 12:02:00,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:00,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:01,130 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-05 12:02:01,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:01,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:01,141 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:01,321 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-05 12:02:01,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:01,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 12:02:01,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:01,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:01,440 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-05 12:02:01,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:01,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-05 12:02:01,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 12:02:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 12:02:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:02:01,446 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 53 states. [2019-09-05 12:02:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:02,004 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2019-09-05 12:02:02,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 12:02:02,004 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 373 [2019-09-05 12:02:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:02,006 INFO L225 Difference]: With dead ends: 389 [2019-09-05 12:02:02,007 INFO L226 Difference]: Without dead ends: 387 [2019-09-05 12:02:02,007 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-05 12:02:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-05 12:02:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-05 12:02:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-05 12:02:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2019-09-05 12:02:02,022 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 373 [2019-09-05 12:02:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:02,022 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2019-09-05 12:02:02,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 12:02:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2019-09-05 12:02:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-05 12:02:02,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:02,024 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:02,024 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:02,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2010097560, now seen corresponding path program 91 times [2019-09-05 12:02:02,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:02,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:02,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:04,611 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-05 12:02:04,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:04,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:04,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:04,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 12:02:04,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:04,819 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-05 12:02:04,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:04,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-05 12:02:04,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 12:02:04,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 12:02:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2353, Invalid=6959, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:02:04,824 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 97 states. [2019-09-05 12:02:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:08,192 INFO L93 Difference]: Finished difference Result 533 states and 581 transitions. [2019-09-05 12:02:08,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 12:02:08,192 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2019-09-05 12:02:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:08,194 INFO L225 Difference]: With dead ends: 533 [2019-09-05 12:02:08,194 INFO L226 Difference]: Without dead ends: 384 [2019-09-05 12:02:08,195 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-05 12:02:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-05 12:02:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-09-05 12:02:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-05 12:02:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2019-09-05 12:02:08,213 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 380 [2019-09-05 12:02:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:08,213 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2019-09-05 12:02:08,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 12:02:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2019-09-05 12:02:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-05 12:02:08,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:08,216 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:08,216 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:08,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1832055255, now seen corresponding path program 92 times [2019-09-05 12:02:08,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:08,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:08,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:08,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:08,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:09,182 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-05 12:02:09,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:09,182 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-05 12:02:09,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:02:09,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:09,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:09,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 12:02:09,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:09,454 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-05 12:02:09,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:09,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 54 [2019-09-05 12:02:09,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-05 12:02:09,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-05 12:02:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 12:02:09,459 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 54 states. [2019-09-05 12:02:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:10,067 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2019-09-05 12:02:10,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 12:02:10,068 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 381 [2019-09-05 12:02:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:10,071 INFO L225 Difference]: With dead ends: 397 [2019-09-05 12:02:10,071 INFO L226 Difference]: Without dead ends: 395 [2019-09-05 12:02:10,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:02:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-05 12:02:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-05 12:02:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-05 12:02:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2019-09-05 12:02:10,091 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 381 [2019-09-05 12:02:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:10,091 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2019-09-05 12:02:10,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-05 12:02:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2019-09-05 12:02:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-05 12:02:10,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:10,093 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:10,094 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2095587654, now seen corresponding path program 93 times [2019-09-05 12:02:10,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:10,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:12,695 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-05 12:02:12,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:12,695 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-05 12:02:12,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:02:13,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-05 12:02:13,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:13,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 12:02:13,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:13,103 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-05 12:02:13,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:13,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-05 12:02:13,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 12:02:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 12:02:13,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:02:13,109 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 99 states. [2019-09-05 12:02:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:16,155 INFO L93 Difference]: Finished difference Result 544 states and 593 transitions. [2019-09-05 12:02:16,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 12:02:16,163 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2019-09-05 12:02:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:16,165 INFO L225 Difference]: With dead ends: 544 [2019-09-05 12:02:16,165 INFO L226 Difference]: Without dead ends: 392 [2019-09-05 12:02:16,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4999, Invalid=16757, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:02:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-05 12:02:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2019-09-05 12:02:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-05 12:02:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2019-09-05 12:02:16,188 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 388 [2019-09-05 12:02:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:16,188 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2019-09-05 12:02:16,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 12:02:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2019-09-05 12:02:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-05 12:02:16,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:16,190 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:16,190 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1877859253, now seen corresponding path program 94 times [2019-09-05 12:02:16,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:16,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:16,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:16,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:16,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:17,308 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-05 12:02:17,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:17,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:02:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:02:17,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:02:17,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:17,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-05 12:02:17,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:17,569 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-05 12:02:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 55 [2019-09-05 12:02:17,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 12:02:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 12:02:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:02:17,574 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 55 states. [2019-09-05 12:02:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:18,156 INFO L93 Difference]: Finished difference Result 405 states and 407 transitions. [2019-09-05 12:02:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 12:02:18,157 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 389 [2019-09-05 12:02:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:18,159 INFO L225 Difference]: With dead ends: 405 [2019-09-05 12:02:18,159 INFO L226 Difference]: Without dead ends: 403 [2019-09-05 12:02:18,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:02:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-05 12:02:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2019-09-05 12:02:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-05 12:02:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2019-09-05 12:02:18,176 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 389 [2019-09-05 12:02:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:18,176 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2019-09-05 12:02:18,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 12:02:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2019-09-05 12:02:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-05 12:02:18,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:18,179 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:18,179 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 603323992, now seen corresponding path program 95 times [2019-09-05 12:02:18,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:18,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:20,907 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-05 12:02:20,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:20,907 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-05 12:02:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:21,099 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-09-05 12:02:21,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:21,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 12:02:21,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:21,185 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-05 12:02:21,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:21,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-05 12:02:21,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 12:02:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 12:02:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2551, Invalid=7549, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:02:21,191 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 101 states. [2019-09-05 12:02:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:25,490 INFO L93 Difference]: Finished difference Result 555 states and 605 transitions. [2019-09-05 12:02:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 12:02:25,491 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 396 [2019-09-05 12:02:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:25,493 INFO L225 Difference]: With dead ends: 555 [2019-09-05 12:02:25,493 INFO L226 Difference]: Without dead ends: 400 [2019-09-05 12:02:25,495 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-05 12:02:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-05 12:02:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-05 12:02:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-05 12:02:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2019-09-05 12:02:25,513 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 396 [2019-09-05 12:02:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:25,514 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2019-09-05 12:02:25,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 12:02:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2019-09-05 12:02:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-05 12:02:25,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:25,516 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:25,517 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash 60695273, now seen corresponding path program 96 times [2019-09-05 12:02:25,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:25,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:25,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:25,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:25,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:26,606 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-05 12:02:26,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:26,607 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-05 12:02:26,617 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:26,808 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-05 12:02:26,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:26,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-05 12:02:26,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:26,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:26,963 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-05 12:02:26,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:26,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-05 12:02:26,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 12:02:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 12:02:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:02:26,968 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 56 states. [2019-09-05 12:02:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:27,533 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2019-09-05 12:02:27,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 12:02:27,534 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 397 [2019-09-05 12:02:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:27,536 INFO L225 Difference]: With dead ends: 413 [2019-09-05 12:02:27,536 INFO L226 Difference]: Without dead ends: 411 [2019-09-05 12:02:27,536 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-05 12:02:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-05 12:02:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-09-05 12:02:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-05 12:02:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2019-09-05 12:02:27,551 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2019-09-05 12:02:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:27,552 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2019-09-05 12:02:27,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 12:02:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2019-09-05 12:02:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-05 12:02:27,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:27,553 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:27,554 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash 898232826, now seen corresponding path program 97 times [2019-09-05 12:02:27,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:27,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:27,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:30,345 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-05 12:02:30,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:30,346 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-05 12:02:30,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:30,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-05 12:02:30,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:30,571 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-05 12:02:30,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:30,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-05 12:02:30,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-05 12:02:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-05 12:02:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2019-09-05 12:02:30,577 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 103 states. [2019-09-05 12:02:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:35,005 INFO L93 Difference]: Finished difference Result 566 states and 617 transitions. [2019-09-05 12:02:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-05 12:02:35,005 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 404 [2019-09-05 12:02:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:35,007 INFO L225 Difference]: With dead ends: 566 [2019-09-05 12:02:35,007 INFO L226 Difference]: Without dead ends: 408 [2019-09-05 12:02:35,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5407, Invalid=18155, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 12:02:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-05 12:02:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-05 12:02:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-05 12:02:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2019-09-05 12:02:35,024 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 404 [2019-09-05 12:02:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:35,024 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2019-09-05 12:02:35,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-05 12:02:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2019-09-05 12:02:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-05 12:02:35,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:35,026 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:35,026 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2020543093, now seen corresponding path program 98 times [2019-09-05 12:02:35,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:35,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:35,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:36,144 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-05 12:02:36,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:36,145 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-05 12:02:36,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:02:36,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:36,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:36,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-05 12:02:36,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:36,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:36,433 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-05 12:02:36,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:36,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-09-05 12:02:36,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 12:02:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 12:02:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:02:36,437 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 57 states. [2019-09-05 12:02:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:37,031 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2019-09-05 12:02:37,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-05 12:02:37,031 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 405 [2019-09-05 12:02:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:37,033 INFO L225 Difference]: With dead ends: 421 [2019-09-05 12:02:37,033 INFO L226 Difference]: Without dead ends: 419 [2019-09-05 12:02:37,033 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-05 12:02:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-05 12:02:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2019-09-05 12:02:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-05 12:02:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2019-09-05 12:02:37,048 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 405 [2019-09-05 12:02:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:37,048 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2019-09-05 12:02:37,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 12:02:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2019-09-05 12:02:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-05 12:02:37,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:37,051 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:37,051 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash 816137496, now seen corresponding path program 99 times [2019-09-05 12:02:37,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:37,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:37,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:39,964 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-05 12:02:39,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:39,964 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-05 12:02:39,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:02:40,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-05 12:02:40,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:40,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-05 12:02:40,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:40,292 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-05 12:02:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-05 12:02:40,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-05 12:02:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-05 12:02:40,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2757, Invalid=8163, Unknown=0, NotChecked=0, Total=10920 [2019-09-05 12:02:40,299 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 105 states. [2019-09-05 12:02:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:44,996 INFO L93 Difference]: Finished difference Result 577 states and 629 transitions. [2019-09-05 12:02:44,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-05 12:02:44,997 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 412 [2019-09-05 12:02:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:44,999 INFO L225 Difference]: With dead ends: 577 [2019-09-05 12:02:44,999 INFO L226 Difference]: Without dead ends: 416 [2019-09-05 12:02:45,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3875 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5617, Invalid=18875, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:02:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-05 12:02:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-09-05 12:02:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-05 12:02:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2019-09-05 12:02:45,020 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 412 [2019-09-05 12:02:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:45,020 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2019-09-05 12:02:45,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-05 12:02:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2019-09-05 12:02:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-05 12:02:45,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:45,022 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:45,022 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1404839849, now seen corresponding path program 100 times [2019-09-05 12:02:45,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:45,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:45,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:45,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:45,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:46,174 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-05 12:02:46,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:46,174 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-05 12:02:46,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:02:46,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:02:46,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:46,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 12:02:46,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:46,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:46,453 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-05 12:02:46,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:46,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 58 [2019-09-05 12:02:46,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-05 12:02:46,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-05 12:02:46,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:02:46,459 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 58 states. [2019-09-05 12:02:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:47,086 INFO L93 Difference]: Finished difference Result 429 states and 431 transitions. [2019-09-05 12:02:47,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:02:47,087 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 413 [2019-09-05 12:02:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:47,090 INFO L225 Difference]: With dead ends: 429 [2019-09-05 12:02:47,090 INFO L226 Difference]: Without dead ends: 427 [2019-09-05 12:02:47,090 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-05 12:02:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-05 12:02:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-05 12:02:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-05 12:02:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2019-09-05 12:02:47,112 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 413 [2019-09-05 12:02:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:47,113 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2019-09-05 12:02:47,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-05 12:02:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2019-09-05 12:02:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-05 12:02:47,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:47,115 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:47,115 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1790896838, now seen corresponding path program 101 times [2019-09-05 12:02:47,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:47,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:47,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:50,250 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-05 12:02:50,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:50,251 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-05 12:02:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:50,450 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2019-09-05 12:02:50,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:50,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-05 12:02:50,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:50,557 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-05 12:02:50,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:50,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-05 12:02:50,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-05 12:02:50,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-05 12:02:50,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2019-09-05 12:02:50,562 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 107 states. [2019-09-05 12:02:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:53,409 INFO L93 Difference]: Finished difference Result 588 states and 641 transitions. [2019-09-05 12:02:53,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-05 12:02:53,409 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 420 [2019-09-05 12:02:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:53,410 INFO L225 Difference]: With dead ends: 588 [2019-09-05 12:02:53,410 INFO L226 Difference]: Without dead ends: 424 [2019-09-05 12:02:53,412 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-05 12:02:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-05 12:02:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-09-05 12:02:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-05 12:02:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2019-09-05 12:02:53,435 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 420 [2019-09-05 12:02:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:53,435 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2019-09-05 12:02:53,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-05 12:02:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2019-09-05 12:02:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-05 12:02:53,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:53,438 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:53,438 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1491544373, now seen corresponding path program 102 times [2019-09-05 12:02:53,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:53,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:53,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:53,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:53,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:54,631 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-05 12:02:54,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:54,631 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-05 12:02:54,641 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:54,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-09-05 12:02:54,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:54,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-05 12:02:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:54,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:55,011 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-05 12:02:55,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:55,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-05 12:02:55,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 12:02:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 12:02:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:02:55,016 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 59 states. [2019-09-05 12:02:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:55,695 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2019-09-05 12:02:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 12:02:55,696 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 421 [2019-09-05 12:02:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:55,698 INFO L225 Difference]: With dead ends: 437 [2019-09-05 12:02:55,698 INFO L226 Difference]: Without dead ends: 435 [2019-09-05 12:02:55,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:02:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-05 12:02:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-05 12:02:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-05 12:02:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2019-09-05 12:02:55,714 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 421 [2019-09-05 12:02:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:55,714 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2019-09-05 12:02:55,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 12:02:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2019-09-05 12:02:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-05 12:02:55,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:55,716 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:55,716 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:55,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1141277736, now seen corresponding path program 103 times [2019-09-05 12:02:55,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:55,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:55,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:58,841 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-05 12:02:58,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:58,842 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-05 12:02:58,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:58,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 12:02:58,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:59,122 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-05 12:02:59,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:59,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-05 12:02:59,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-05 12:02:59,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-05 12:02:59,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=8801, Unknown=0, NotChecked=0, Total=11772 [2019-09-05 12:02:59,126 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 109 states. [2019-09-05 12:03:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:02,242 INFO L93 Difference]: Finished difference Result 599 states and 653 transitions. [2019-09-05 12:03:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-05 12:03:02,242 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 428 [2019-09-05 12:03:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:02,243 INFO L225 Difference]: With dead ends: 599 [2019-09-05 12:03:02,243 INFO L226 Difference]: Without dead ends: 432 [2019-09-05 12:03:02,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6049, Invalid=20357, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:03:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-05 12:03:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-09-05 12:03:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-05 12:03:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2019-09-05 12:03:02,260 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 428 [2019-09-05 12:03:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:02,261 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2019-09-05 12:03:02,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-05 12:03:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2019-09-05 12:03:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-05 12:03:02,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:02,262 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:02,263 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1723655063, now seen corresponding path program 104 times [2019-09-05 12:03:02,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:03,515 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-05 12:03:03,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:03,515 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-05 12:03:03,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:03:03,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:03,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:03,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-05 12:03:03,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:03,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:03,820 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-05 12:03:03,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:03,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 60 [2019-09-05 12:03:03,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-05 12:03:03,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-05 12:03:03,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 12:03:03,824 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 60 states. [2019-09-05 12:03:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:04,451 INFO L93 Difference]: Finished difference Result 445 states and 447 transitions. [2019-09-05 12:03:04,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 12:03:04,451 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 429 [2019-09-05 12:03:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:04,453 INFO L225 Difference]: With dead ends: 445 [2019-09-05 12:03:04,453 INFO L226 Difference]: Without dead ends: 443 [2019-09-05 12:03:04,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:03:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-05 12:03:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-05 12:03:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-05 12:03:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2019-09-05 12:03:04,469 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 429 [2019-09-05 12:03:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:04,469 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2019-09-05 12:03:04,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-05 12:03:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2019-09-05 12:03:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-05 12:03:04,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:04,471 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:04,471 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1264498566, now seen corresponding path program 105 times [2019-09-05 12:03:04,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:04,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:04,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:07,723 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-05 12:03:07,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:07,723 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-05 12:03:07,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:07,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-05 12:03:07,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:07,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-05 12:03:07,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:08,093 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-05 12:03:08,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:08,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-05 12:03:08,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-05 12:03:08,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-05 12:03:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2019-09-05 12:03:08,100 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 111 states. [2019-09-05 12:03:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:13,271 INFO L93 Difference]: Finished difference Result 610 states and 665 transitions. [2019-09-05 12:03:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-05 12:03:13,271 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 436 [2019-09-05 12:03:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:13,273 INFO L225 Difference]: With dead ends: 610 [2019-09-05 12:03:13,273 INFO L226 Difference]: Without dead ends: 440 [2019-09-05 12:03:13,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6271, Invalid=21119, Unknown=0, NotChecked=0, Total=27390 [2019-09-05 12:03:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-05 12:03:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-09-05 12:03:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-05 12:03:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2019-09-05 12:03:13,297 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 436 [2019-09-05 12:03:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:13,297 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2019-09-05 12:03:13,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-05 12:03:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2019-09-05 12:03:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-05 12:03:13,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:13,300 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:13,300 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash -116537333, now seen corresponding path program 106 times [2019-09-05 12:03:13,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:13,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:13,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:13,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:13,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:14,575 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-05 12:03:14,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:14,575 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-05 12:03:14,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:14,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:14,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:14,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-05 12:03:14,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:14,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:14,875 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-05 12:03:14,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:14,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-09-05 12:03:14,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-05 12:03:14,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-05 12:03:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:03:14,880 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 61 states. [2019-09-05 12:03:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:15,425 INFO L93 Difference]: Finished difference Result 453 states and 455 transitions. [2019-09-05 12:03:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-05 12:03:15,426 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 437 [2019-09-05 12:03:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:15,427 INFO L225 Difference]: With dead ends: 453 [2019-09-05 12:03:15,427 INFO L226 Difference]: Without dead ends: 451 [2019-09-05 12:03:15,428 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-05 12:03:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-05 12:03:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2019-09-05 12:03:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-05 12:03:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2019-09-05 12:03:15,444 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 437 [2019-09-05 12:03:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:15,444 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2019-09-05 12:03:15,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-05 12:03:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2019-09-05 12:03:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-05 12:03:15,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:15,446 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:15,446 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 51290776, now seen corresponding path program 107 times [2019-09-05 12:03:15,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:15,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:15,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:18,807 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-05 12:03:18,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:18,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 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-05 12:03:18,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:03:19,027 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-05 12:03:19,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:19,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-05 12:03:19,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:19,147 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-05 12:03:19,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-05 12:03:19,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-05 12:03:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-05 12:03:19,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3193, Invalid=9463, Unknown=0, NotChecked=0, Total=12656 [2019-09-05 12:03:19,154 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 113 states. [2019-09-05 12:03:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:24,567 INFO L93 Difference]: Finished difference Result 621 states and 677 transitions. [2019-09-05 12:03:24,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-05 12:03:24,568 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 444 [2019-09-05 12:03:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:24,569 INFO L225 Difference]: With dead ends: 621 [2019-09-05 12:03:24,569 INFO L226 Difference]: Without dead ends: 448 [2019-09-05 12:03:24,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4509 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6497, Invalid=21895, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:03:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-05 12:03:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-09-05 12:03:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-05 12:03:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2019-09-05 12:03:24,592 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 444 [2019-09-05 12:03:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:24,592 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2019-09-05 12:03:24,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-05 12:03:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2019-09-05 12:03:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-05 12:03:24,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:24,594 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:24,594 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash 156172585, now seen corresponding path program 108 times [2019-09-05 12:03:24,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:24,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:24,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:25,923 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-05 12:03:25,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:25,923 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-05 12:03:25,933 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:03:26,159 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-05 12:03:26,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:26,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-05 12:03:26,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:26,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:26,327 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-05 12:03:26,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:26,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 62 [2019-09-05 12:03:26,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-05 12:03:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-05 12:03:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 12:03:26,333 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 62 states. [2019-09-05 12:03:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:26,971 INFO L93 Difference]: Finished difference Result 461 states and 463 transitions. [2019-09-05 12:03:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 12:03:26,972 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 445 [2019-09-05 12:03:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:26,973 INFO L225 Difference]: With dead ends: 461 [2019-09-05 12:03:26,973 INFO L226 Difference]: Without dead ends: 459 [2019-09-05 12:03:26,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:03:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-05 12:03:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2019-09-05 12:03:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-05 12:03:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2019-09-05 12:03:26,993 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 445 [2019-09-05 12:03:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:26,993 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2019-09-05 12:03:26,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-05 12:03:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2019-09-05 12:03:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-05 12:03:26,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:26,995 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:26,995 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1492218950, now seen corresponding path program 109 times [2019-09-05 12:03:26,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:26,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:26,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:30,548 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-05 12:03:30,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:30,549 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-05 12:03:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:30,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-05 12:03:30,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:30,803 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-05 12:03:30,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:30,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-05 12:03:30,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-05 12:03:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-05 12:03:30,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:03:30,809 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 115 states. [2019-09-05 12:03:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:36,493 INFO L93 Difference]: Finished difference Result 632 states and 689 transitions. [2019-09-05 12:03:36,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-05 12:03:36,494 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 452 [2019-09-05 12:03:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:36,495 INFO L225 Difference]: With dead ends: 632 [2019-09-05 12:03:36,495 INFO L226 Difference]: Without dead ends: 456 [2019-09-05 12:03:36,497 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-05 12:03:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-05 12:03:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-09-05 12:03:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-05 12:03:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2019-09-05 12:03:36,514 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 452 [2019-09-05 12:03:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:36,515 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2019-09-05 12:03:36,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-05 12:03:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2019-09-05 12:03:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-05 12:03:36,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:36,517 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:36,517 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1999386293, now seen corresponding path program 110 times [2019-09-05 12:03:36,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:36,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:36,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:37,925 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-05 12:03:37,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:37,925 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-05 12:03:37,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:03:38,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:38,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:38,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-05 12:03:38,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:38,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:38,372 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-05 12:03:38,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:38,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-09-05 12:03:38,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 12:03:38,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 12:03:38,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:03:38,377 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 63 states. [2019-09-05 12:03:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:39,086 INFO L93 Difference]: Finished difference Result 469 states and 471 transitions. [2019-09-05 12:03:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-05 12:03:39,086 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 453 [2019-09-05 12:03:39,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:39,088 INFO L225 Difference]: With dead ends: 469 [2019-09-05 12:03:39,088 INFO L226 Difference]: Without dead ends: 467 [2019-09-05 12:03:39,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1727, Invalid=2305, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 12:03:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-05 12:03:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-05 12:03:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-05 12:03:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2019-09-05 12:03:39,111 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 453 [2019-09-05 12:03:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:39,111 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2019-09-05 12:03:39,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 12:03:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2019-09-05 12:03:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-05 12:03:39,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:39,114 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:39,114 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 570472792, now seen corresponding path program 111 times [2019-09-05 12:03:39,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:39,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:39,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:42,802 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-05 12:03:42,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:42,803 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-05 12:03:42,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:43,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-05 12:03:43,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:43,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-05 12:03:43,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:43,194 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-05 12:03:43,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:43,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-05 12:03:43,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-05 12:03:43,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-05 12:03:43,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3423, Invalid=10149, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:03:43,200 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 117 states. [2019-09-05 12:03:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:48,921 INFO L93 Difference]: Finished difference Result 643 states and 701 transitions. [2019-09-05 12:03:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-05 12:03:48,921 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 460 [2019-09-05 12:03:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:48,923 INFO L225 Difference]: With dead ends: 643 [2019-09-05 12:03:48,923 INFO L226 Difference]: Without dead ends: 464 [2019-09-05 12:03:48,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4844 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6961, Invalid=23489, Unknown=0, NotChecked=0, Total=30450 [2019-09-05 12:03:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-05 12:03:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-05 12:03:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-05 12:03:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-09-05 12:03:48,949 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 460 [2019-09-05 12:03:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:48,950 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-09-05 12:03:48,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-05 12:03:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-09-05 12:03:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-05 12:03:48,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:48,952 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:48,953 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1208232471, now seen corresponding path program 112 times [2019-09-05 12:03:48,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:48,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:48,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:50,349 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-05 12:03:50,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:50,349 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-05 12:03:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:50,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:50,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:50,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-05 12:03:50,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:50,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:50,699 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-05 12:03:50,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:50,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 64 [2019-09-05 12:03:50,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-05 12:03:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-05 12:03:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 12:03:50,705 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 64 states. [2019-09-05 12:03:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:51,459 INFO L93 Difference]: Finished difference Result 477 states and 479 transitions. [2019-09-05 12:03:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 12:03:51,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 461 [2019-09-05 12:03:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:51,462 INFO L225 Difference]: With dead ends: 477 [2019-09-05 12:03:51,462 INFO L226 Difference]: Without dead ends: 475 [2019-09-05 12:03:51,462 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-05 12:03:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-05 12:03:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-09-05 12:03:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-05 12:03:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2019-09-05 12:03:51,481 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 461 [2019-09-05 12:03:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:51,482 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2019-09-05 12:03:51,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-05 12:03:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2019-09-05 12:03:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-05 12:03:51,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:51,483 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:51,484 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1058218246, now seen corresponding path program 113 times [2019-09-05 12:03:51,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:51,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:51,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:51,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:51,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:55,304 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-05 12:03:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:55,304 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-05 12:03:55,313 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:03:55,547 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2019-09-05 12:03:55,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:55,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-05 12:03:55,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:55,663 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-05 12:03:55,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:55,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-05 12:03:55,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-05 12:03:55,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-05 12:03:55,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 12:03:55,669 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 119 states. [2019-09-05 12:04:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:01,582 INFO L93 Difference]: Finished difference Result 654 states and 713 transitions. [2019-09-05 12:04:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-05 12:04:01,582 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 468 [2019-09-05 12:04:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:01,583 INFO L225 Difference]: With dead ends: 654 [2019-09-05 12:04:01,584 INFO L226 Difference]: Without dead ends: 472 [2019-09-05 12:04:01,586 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-05 12:04:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-05 12:04:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-05 12:04:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-05 12:04:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2019-09-05 12:04:01,604 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 468 [2019-09-05 12:04:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:01,604 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2019-09-05 12:04:01,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-05 12:04:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2019-09-05 12:04:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-05 12:04:01,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:01,606 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:01,606 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:01,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1563501941, now seen corresponding path program 114 times [2019-09-05 12:04:01,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:01,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:01,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:01,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:01,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:03,073 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-05 12:04:03,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:03,073 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-05 12:04:03,084 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:03,334 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2019-09-05 12:04:03,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:03,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-05 12:04:03,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:03,497 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-05 12:04:03,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:03,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-05 12:04:03,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 12:04:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 12:04:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:04:03,503 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 65 states. [2019-09-05 12:04:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:04,179 INFO L93 Difference]: Finished difference Result 485 states and 487 transitions. [2019-09-05 12:04:04,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 12:04:04,180 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 469 [2019-09-05 12:04:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:04,182 INFO L225 Difference]: With dead ends: 485 [2019-09-05 12:04:04,182 INFO L226 Difference]: Without dead ends: 483 [2019-09-05 12:04:04,183 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-05 12:04:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-05 12:04:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2019-09-05 12:04:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-05 12:04:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2019-09-05 12:04:04,200 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 469 [2019-09-05 12:04:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:04,200 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2019-09-05 12:04:04,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 12:04:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2019-09-05 12:04:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-05 12:04:04,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:04,203 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:04,204 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:04,204 INFO L82 PathProgramCache]: Analyzing trace with hash -739524584, now seen corresponding path program 115 times [2019-09-05 12:04:04,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:04,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:04,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:08,176 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-05 12:04:08,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:08,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 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-05 12:04:08,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:08,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-05 12:04:08,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:08,456 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-05 12:04:08,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:08,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-05 12:04:08,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-05 12:04:08,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-05 12:04:08,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3661, Invalid=10859, Unknown=0, NotChecked=0, Total=14520 [2019-09-05 12:04:08,462 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 121 states. [2019-09-05 12:04:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:14,774 INFO L93 Difference]: Finished difference Result 665 states and 725 transitions. [2019-09-05 12:04:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-05 12:04:14,774 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 476 [2019-09-05 12:04:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:14,775 INFO L225 Difference]: With dead ends: 665 [2019-09-05 12:04:14,775 INFO L226 Difference]: Without dead ends: 480 [2019-09-05 12:04:14,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5191 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7441, Invalid=25139, Unknown=0, NotChecked=0, Total=32580 [2019-09-05 12:04:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-05 12:04:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-05 12:04:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-05 12:04:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2019-09-05 12:04:14,799 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 476 [2019-09-05 12:04:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:14,800 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2019-09-05 12:04:14,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-05 12:04:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2019-09-05 12:04:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-05 12:04:14,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:14,802 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:14,803 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:14,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:14,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1483053737, now seen corresponding path program 116 times [2019-09-05 12:04:14,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:14,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:14,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:14,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:14,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:16,300 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-05 12:04:16,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:16,301 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-05 12:04:16,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:16,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:16,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:16,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-05 12:04:16,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:16,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:16,665 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-05 12:04:16,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:16,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 66 [2019-09-05 12:04:16,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-05 12:04:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-05 12:04:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:04:16,670 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 66 states. [2019-09-05 12:04:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:17,296 INFO L93 Difference]: Finished difference Result 493 states and 495 transitions. [2019-09-05 12:04:17,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 12:04:17,297 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 477 [2019-09-05 12:04:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:17,298 INFO L225 Difference]: With dead ends: 493 [2019-09-05 12:04:17,299 INFO L226 Difference]: Without dead ends: 491 [2019-09-05 12:04:17,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:04:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-05 12:04:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2019-09-05 12:04:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-05 12:04:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2019-09-05 12:04:17,319 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 477 [2019-09-05 12:04:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:17,319 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2019-09-05 12:04:17,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-05 12:04:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2019-09-05 12:04:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-05 12:04:17,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:17,321 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:17,321 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:17,321 INFO L82 PathProgramCache]: Analyzing trace with hash -677363142, now seen corresponding path program 117 times [2019-09-05 12:04:17,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:17,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:17,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:17,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:17,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:21,316 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-05 12:04:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:21,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 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-05 12:04:21,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:21,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-09-05 12:04:21,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:21,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-05 12:04:21,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:21,773 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-05 12:04:21,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:21,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-05 12:04:21,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-05 12:04:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-05 12:04:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2019-09-05 12:04:21,779 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 123 states. [2019-09-05 12:04:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:28,348 INFO L93 Difference]: Finished difference Result 676 states and 737 transitions. [2019-09-05 12:04:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-05 12:04:28,348 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 484 [2019-09-05 12:04:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:28,349 INFO L225 Difference]: With dead ends: 676 [2019-09-05 12:04:28,350 INFO L226 Difference]: Without dead ends: 488 [2019-09-05 12:04:28,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5369 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7687, Invalid=25985, Unknown=0, NotChecked=0, Total=33672 [2019-09-05 12:04:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-05 12:04:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-05 12:04:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-05 12:04:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2019-09-05 12:04:28,382 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 484 [2019-09-05 12:04:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:28,382 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2019-09-05 12:04:28,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-05 12:04:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2019-09-05 12:04:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-05 12:04:28,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:28,385 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:28,386 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash 342031307, now seen corresponding path program 118 times [2019-09-05 12:04:28,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:28,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:28,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:30,053 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-05 12:04:30,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:30,053 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-05 12:04:30,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:30,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:30,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:30,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-05 12:04:30,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:30,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:30,400 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-05 12:04:30,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:30,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 67 [2019-09-05 12:04:30,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 12:04:30,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 12:04:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:04:30,406 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 67 states. [2019-09-05 12:04:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:31,226 INFO L93 Difference]: Finished difference Result 501 states and 503 transitions. [2019-09-05 12:04:31,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-05 12:04:31,227 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 485 [2019-09-05 12:04:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:31,228 INFO L225 Difference]: With dead ends: 501 [2019-09-05 12:04:31,228 INFO L226 Difference]: Without dead ends: 499 [2019-09-05 12:04:31,229 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-05 12:04:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-05 12:04:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2019-09-05 12:04:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-05 12:04:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2019-09-05 12:04:31,248 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 485 [2019-09-05 12:04:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:31,248 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2019-09-05 12:04:31,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 12:04:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2019-09-05 12:04:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-05 12:04:31,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:31,250 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:31,251 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:31,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:31,251 INFO L82 PathProgramCache]: Analyzing trace with hash 854308568, now seen corresponding path program 119 times [2019-09-05 12:04:31,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:31,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:31,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:31,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:35,408 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-05 12:04:35,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:35,408 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-05 12:04:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:04:35,847 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-05 12:04:35,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:35,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-05 12:04:35,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:35,999 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): Stream closed [2019-09-05 12:04:36,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:36,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-05 12:04:36,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-05 12:04:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-05 12:04:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3907, Invalid=11593, Unknown=0, NotChecked=0, Total=15500 [2019-09-05 12:04:36,008 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 125 states. [2019-09-05 12:04:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:40,436 INFO L93 Difference]: Finished difference Result 687 states and 749 transitions. [2019-09-05 12:04:40,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-05 12:04:40,437 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 492 [2019-09-05 12:04:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:40,438 INFO L225 Difference]: With dead ends: 687 [2019-09-05 12:04:40,438 INFO L226 Difference]: Without dead ends: 496 [2019-09-05 12:04:40,440 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-05 12:04:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-05 12:04:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2019-09-05 12:04:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-05 12:04:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 497 transitions. [2019-09-05 12:04:40,458 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 497 transitions. Word has length 492 [2019-09-05 12:04:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:40,459 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 497 transitions. [2019-09-05 12:04:40,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-05 12:04:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 497 transitions. [2019-09-05 12:04:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-05 12:04:40,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:40,461 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:40,461 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -56078487, now seen corresponding path program 120 times [2019-09-05 12:04:40,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:40,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:40,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:42,091 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-05 12:04:42,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:42,091 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-05 12:04:42,101 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:04:42,364 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-05 12:04:42,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:42,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-05 12:04:42,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:42,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:42,622 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-05 12:04:42,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:42,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 68 [2019-09-05 12:04:42,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 12:04:42,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 12:04:42,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:04:42,627 INFO L87 Difference]: Start difference. First operand 496 states and 497 transitions. Second operand 68 states. [2019-09-05 12:04:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:43,431 INFO L93 Difference]: Finished difference Result 509 states and 511 transitions. [2019-09-05 12:04:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-05 12:04:43,431 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 493 [2019-09-05 12:04:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:43,437 INFO L225 Difference]: With dead ends: 509 [2019-09-05 12:04:43,437 INFO L226 Difference]: Without dead ends: 507 [2019-09-05 12:04:43,437 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-05 12:04:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-05 12:04:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-05 12:04:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-05 12:04:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2019-09-05 12:04:43,466 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 493 [2019-09-05 12:04:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:43,467 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2019-09-05 12:04:43,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 12:04:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2019-09-05 12:04:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-05 12:04:43,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:43,470 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:43,470 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:43,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2121484934, now seen corresponding path program 121 times [2019-09-05 12:04:43,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:43,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:43,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:43,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:43,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:47,888 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-05 12:04:47,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:47,888 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-05 12:04:47,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:48,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-05 12:04:48,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:48,212 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-05 12:04:48,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:48,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-05 12:04:48,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-05 12:04:48,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-05 12:04:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4033, Invalid=11969, Unknown=0, NotChecked=0, Total=16002 [2019-09-05 12:04:48,218 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 127 states. [2019-09-05 12:04:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:53,613 INFO L93 Difference]: Finished difference Result 698 states and 761 transitions. [2019-09-05 12:04:53,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-05 12:04:53,613 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 500 [2019-09-05 12:04:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:53,614 INFO L225 Difference]: With dead ends: 698 [2019-09-05 12:04:53,614 INFO L226 Difference]: Without dead ends: 504 [2019-09-05 12:04:53,617 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-05 12:04:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-05 12:04:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-05 12:04:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-05 12:04:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2019-09-05 12:04:53,636 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 500 [2019-09-05 12:04:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:53,636 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2019-09-05 12:04:53,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-05 12:04:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2019-09-05 12:04:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-05 12:04:53,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:53,638 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:53,638 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1811164427, now seen corresponding path program 122 times [2019-09-05 12:04:53,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:53,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:55,311 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-05 12:04:55,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:55,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:04:55,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:55,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:55,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:55,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-05 12:04:55,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:55,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:55,661 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-05 12:04:55,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:55,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 69 [2019-09-05 12:04:55,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-05 12:04:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-05 12:04:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:04:55,667 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 69 states. [2019-09-05 12:04:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:56,673 INFO L93 Difference]: Finished difference Result 517 states and 519 transitions. [2019-09-05 12:04:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-05 12:04:56,673 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 501 [2019-09-05 12:04:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:56,675 INFO L225 Difference]: With dead ends: 517 [2019-09-05 12:04:56,675 INFO L226 Difference]: Without dead ends: 515 [2019-09-05 12:04:56,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 12:04:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-05 12:04:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-09-05 12:04:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-05 12:04:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2019-09-05 12:04:56,696 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 501 [2019-09-05 12:04:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:56,696 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2019-09-05 12:04:56,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-05 12:04:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2019-09-05 12:04:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-05 12:04:56,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:56,698 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:56,698 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2015141272, now seen corresponding path program 123 times [2019-09-05 12:04:56,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:56,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:56,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:01,162 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-05 12:05:01,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:01,163 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-05 12:05:01,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:01,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-09-05 12:05:01,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:01,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-05 12:05:01,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:01,633 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-05 12:05:01,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:01,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-05 12:05:01,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-05 12:05:01,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-05 12:05:01,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4161, Invalid=12351, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:05:01,641 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 129 states. [2019-09-05 12:05:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:05,793 INFO L93 Difference]: Finished difference Result 709 states and 773 transitions. [2019-09-05 12:05:05,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-05 12:05:05,794 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 508 [2019-09-05 12:05:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:05,795 INFO L225 Difference]: With dead ends: 709 [2019-09-05 12:05:05,795 INFO L226 Difference]: Without dead ends: 512 [2019-09-05 12:05:05,797 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-05 12:05:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-05 12:05:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-09-05 12:05:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-05 12:05:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2019-09-05 12:05:05,827 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 508 [2019-09-05 12:05:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:05,827 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2019-09-05 12:05:05,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-05 12:05:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2019-09-05 12:05:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-05 12:05:05,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:05,830 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:05,831 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash -706743255, now seen corresponding path program 124 times [2019-09-05 12:05:05,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:05,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:05,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:07,608 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-05 12:05:07,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:07,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:05:07,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:07,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:07,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:07,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-05 12:05:07,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:07,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:07,993 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-05 12:05:07,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:07,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 70 [2019-09-05 12:05:07,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-05 12:05:07,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-05 12:05:07,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 12:05:07,998 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 70 states. [2019-09-05 12:05:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:08,849 INFO L93 Difference]: Finished difference Result 525 states and 527 transitions. [2019-09-05 12:05:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 12:05:08,850 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 509 [2019-09-05 12:05:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:08,852 INFO L225 Difference]: With dead ends: 525 [2019-09-05 12:05:08,852 INFO L226 Difference]: Without dead ends: 523 [2019-09-05 12:05:08,853 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-05 12:05:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-05 12:05:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2019-09-05 12:05:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-05 12:05:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2019-09-05 12:05:08,884 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 509 [2019-09-05 12:05:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:08,884 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2019-09-05 12:05:08,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-05 12:05:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2019-09-05 12:05:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-05 12:05:08,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:08,888 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:08,888 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1444296890, now seen corresponding path program 125 times [2019-09-05 12:05:08,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:08,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:08,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:13,455 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-05 12:05:13,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:13,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:05:13,465 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:13,732 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 64 check-sat command(s) [2019-09-05 12:05:13,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:13,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-05 12:05:13,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:13,910 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-05 12:05:13,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:13,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-05 12:05:13,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-05 12:05:13,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-05 12:05:13,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4291, Invalid=12739, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:05:13,917 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 131 states. [2019-09-05 12:05:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:19,476 INFO L93 Difference]: Finished difference Result 720 states and 785 transitions. [2019-09-05 12:05:19,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-05 12:05:19,477 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 516 [2019-09-05 12:05:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:19,478 INFO L225 Difference]: With dead ends: 720 [2019-09-05 12:05:19,478 INFO L226 Difference]: Without dead ends: 520 [2019-09-05 12:05:19,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6111 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8711, Invalid=29509, Unknown=0, NotChecked=0, Total=38220 [2019-09-05 12:05:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-05 12:05:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-05 12:05:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-05 12:05:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2019-09-05 12:05:19,514 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 516 [2019-09-05 12:05:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:19,514 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2019-09-05 12:05:19,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-05 12:05:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2019-09-05 12:05:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-05 12:05:19,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:19,518 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:19,518 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash 954625611, now seen corresponding path program 126 times [2019-09-05 12:05:19,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:21,361 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-05 12:05:21,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:21,362 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-05 12:05:21,372 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:21,663 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2019-09-05 12:05:21,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:21,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-05 12:05:21,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2232 proven. 6145 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-09-05 12:05:22,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 71] total 72 [2019-09-05 12:05:22,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-05 12:05:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-05 12:05:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2223, Invalid=2889, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 12:05:22,126 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 72 states. [2019-09-05 12:05:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:23,128 INFO L93 Difference]: Finished difference Result 529 states and 530 transitions. [2019-09-05 12:05:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 12:05:23,128 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 517 [2019-09-05 12:05:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:23,131 INFO L225 Difference]: With dead ends: 529 [2019-09-05 12:05:23,131 INFO L226 Difference]: Without dead ends: 527 [2019-09-05 12:05:23,132 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-05 12:05:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-05 12:05:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-05 12:05:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-05 12:05:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2019-09-05 12:05:23,156 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 517 [2019-09-05 12:05:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:23,156 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2019-09-05 12:05:23,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-05 12:05:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2019-09-05 12:05:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-05 12:05:23,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:23,159 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:23,159 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1147505576, now seen corresponding path program 127 times [2019-09-05 12:05:23,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:23,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:23,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:27,914 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-05 12:05:27,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:27,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:27,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:28,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-05 12:05:28,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:28,236 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-05 12:05:28,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:28,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-05 12:05:28,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-05 12:05:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-05 12:05:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4423, Invalid=13133, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:05:28,242 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 133 states. [2019-09-05 12:05:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:33,803 INFO L93 Difference]: Finished difference Result 731 states and 797 transitions. [2019-09-05 12:05:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-05 12:05:33,803 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 524 [2019-09-05 12:05:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:33,805 INFO L225 Difference]: With dead ends: 731 [2019-09-05 12:05:33,805 INFO L226 Difference]: Without dead ends: 528 [2019-09-05 12:05:33,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6304 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8977, Invalid=30425, Unknown=0, NotChecked=0, Total=39402 [2019-09-05 12:05:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-05 12:05:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-09-05 12:05:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-05 12:05:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2019-09-05 12:05:33,841 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 524 [2019-09-05 12:05:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:33,841 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2019-09-05 12:05:33,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-05 12:05:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2019-09-05 12:05:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-05 12:05:33,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:33,845 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:33,845 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -198670103, now seen corresponding path program 128 times [2019-09-05 12:05:33,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:33,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:33,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:33,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:35,743 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-05 12:05:35,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:35,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:35,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:35,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:35,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-05 12:05:35,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:36,279 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-05 12:05:36,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:36,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 72] total 73 [2019-09-05 12:05:36,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-05 12:05:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-05 12:05:36,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2290, Invalid=2966, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:05:36,285 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 73 states. [2019-09-05 12:05:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:37,136 INFO L93 Difference]: Finished difference Result 537 states and 538 transitions. [2019-09-05 12:05:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-05 12:05:37,137 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 525 [2019-09-05 12:05:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:37,139 INFO L225 Difference]: With dead ends: 537 [2019-09-05 12:05:37,139 INFO L226 Difference]: Without dead ends: 535 [2019-09-05 12:05:37,140 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-05 12:05:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-05 12:05:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-09-05 12:05:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-05 12:05:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2019-09-05 12:05:37,164 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 525 [2019-09-05 12:05:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:37,164 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2019-09-05 12:05:37,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-05 12:05:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2019-09-05 12:05:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-09-05 12:05:37,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:37,166 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:37,166 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash 765512698, now seen corresponding path program 129 times [2019-09-05 12:05:37,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:37,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:37,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:41,995 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-05 12:05:41,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:41,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:05:42,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:42,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-05 12:05:42,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:42,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-05 12:05:42,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (130)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:05:42,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:42,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-05 12:05:42,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-05 12:05:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-05 12:05:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4557, Invalid=13533, Unknown=0, NotChecked=0, Total=18090 [2019-09-05 12:05:42,603 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 135 states. [2019-09-05 12:05:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:46,573 INFO L93 Difference]: Finished difference Result 742 states and 809 transitions. [2019-09-05 12:05:46,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-05 12:05:46,574 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 532 [2019-09-05 12:05:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:46,575 INFO L225 Difference]: With dead ends: 742 [2019-09-05 12:05:46,575 INFO L226 Difference]: Without dead ends: 536 [2019-09-05 12:05:46,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6500 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=9247, Invalid=31355, Unknown=0, NotChecked=0, Total=40602 [2019-09-05 12:05:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-05 12:05:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-09-05 12:05:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-09-05 12:05:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2019-09-05 12:05:46,611 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 532 [2019-09-05 12:05:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:46,612 INFO L475 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2019-09-05 12:05:46,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-05 12:05:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2019-09-05 12:05:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-09-05 12:05:46,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:46,615 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:46,615 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1268629387, now seen corresponding path program 130 times [2019-09-05 12:05:46,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:46,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:46,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:46,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:46,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:48,511 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-05 12:05:48,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:48,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 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-05 12:05:48,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:48,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:48,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:48,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-05 12:05:48,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:48,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:49,009 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-05 12:05:49,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 73] total 74 [2019-09-05 12:05:49,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 12:05:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 12:05:49,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2358, Invalid=3044, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:05:49,015 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 74 states. [2019-09-05 12:05:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:49,995 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2019-09-05 12:05:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 12:05:49,995 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 533 [2019-09-05 12:05:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:49,996 INFO L225 Difference]: With dead ends: 545 [2019-09-05 12:05:49,997 INFO L226 Difference]: Without dead ends: 543 [2019-09-05 12:05:49,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 595 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2371, Invalid=3329, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:05:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-05 12:05:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-09-05 12:05:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-05 12:05:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2019-09-05 12:05:50,019 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 533 [2019-09-05 12:05:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:50,019 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2019-09-05 12:05:50,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 12:05:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2019-09-05 12:05:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-09-05 12:05:50,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:50,022 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:50,022 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1266599144, now seen corresponding path program 131 times [2019-09-05 12:05:50,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:50,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:54,984 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-05 12:05:54,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:54,984 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-05 12:05:54,995 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:55,286 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2019-09-05 12:05:55,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:55,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-05 12:05:55,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:55,441 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-05 12:05:55,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-05 12:05:55,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-05 12:05:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-05 12:05:55,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4693, Invalid=13939, Unknown=0, NotChecked=0, Total=18632 [2019-09-05 12:05:55,448 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 137 states. [2019-09-05 12:06:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:01,827 INFO L93 Difference]: Finished difference Result 753 states and 821 transitions. [2019-09-05 12:06:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-05 12:06:01,827 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 540 [2019-09-05 12:06:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:01,828 INFO L225 Difference]: With dead ends: 753 [2019-09-05 12:06:01,828 INFO L226 Difference]: Without dead ends: 544 [2019-09-05 12:06:01,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6699 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=9521, Invalid=32299, Unknown=0, NotChecked=0, Total=41820 [2019-09-05 12:06:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-05 12:06:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-09-05 12:06:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-05 12:06:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2019-09-05 12:06:01,852 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 540 [2019-09-05 12:06:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:01,852 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2019-09-05 12:06:01,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-05 12:06:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2019-09-05 12:06:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-09-05 12:06:01,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:01,855 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:01,855 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash 111021481, now seen corresponding path program 132 times [2019-09-05 12:06:01,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:01,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:01,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:01,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:03,757 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-05 12:06:03,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:03,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:06:03,788 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:04,095 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-05 12:06:04,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:04,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-05 12:06:04,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:04,377 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-05 12:06:04,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:04,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 74] total 75 [2019-09-05 12:06:04,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 12:06:04,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 12:06:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2427, Invalid=3123, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 12:06:04,384 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 75 states. [2019-09-05 12:06:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:05,430 INFO L93 Difference]: Finished difference Result 553 states and 554 transitions. [2019-09-05 12:06:05,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-05 12:06:05,430 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 541 [2019-09-05 12:06:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:05,432 INFO L225 Difference]: With dead ends: 553 [2019-09-05 12:06:05,432 INFO L226 Difference]: Without dead ends: 551 [2019-09-05 12:06:05,433 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-05 12:06:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-05 12:06:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-05 12:06:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-05 12:06:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2019-09-05 12:06:05,455 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 541 [2019-09-05 12:06:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:05,456 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2019-09-05 12:06:05,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 12:06:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2019-09-05 12:06:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-05 12:06:05,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:05,459 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:05,459 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1636855610, now seen corresponding path program 133 times [2019-09-05 12:06:05,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:05,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:05,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:05,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:10,607 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-05 12:06:10,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:10,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:06:10,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:10,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-05 12:06:10,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:10,992 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-05 12:06:10,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:10,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-05 12:06:10,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-05 12:06:10,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-05 12:06:10,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4831, Invalid=14351, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:06:10,999 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 139 states. [2019-09-05 12:06:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:15,486 INFO L93 Difference]: Finished difference Result 764 states and 833 transitions. [2019-09-05 12:06:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-05 12:06:15,486 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 548 [2019-09-05 12:06:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:15,487 INFO L225 Difference]: With dead ends: 764 [2019-09-05 12:06:15,487 INFO L226 Difference]: Without dead ends: 552 [2019-09-05 12:06:15,491 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-05 12:06:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-05 12:06:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-09-05 12:06:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-05 12:06:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 553 transitions. [2019-09-05 12:06:15,513 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 553 transitions. Word has length 548 [2019-09-05 12:06:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:15,514 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 553 transitions. [2019-09-05 12:06:15,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-05 12:06:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 553 transitions. [2019-09-05 12:06:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-05 12:06:15,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:15,516 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:15,516 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:15,517 INFO L82 PathProgramCache]: Analyzing trace with hash -176283445, now seen corresponding path program 134 times [2019-09-05 12:06:15,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:15,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:15,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:15,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:15,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:17,529 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-05 12:06:17,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:17,529 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-05 12:06:17,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:06:17,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:06:17,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:17,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-05 12:06:17,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:18,029 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-05 12:06:18,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:18,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 75] total 76 [2019-09-05 12:06:18,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 12:06:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 12:06:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2497, Invalid=3203, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:06:18,034 INFO L87 Difference]: Start difference. First operand 552 states and 553 transitions. Second operand 76 states. [2019-09-05 12:06:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:19,035 INFO L93 Difference]: Finished difference Result 561 states and 562 transitions. [2019-09-05 12:06:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 12:06:19,036 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 549 [2019-09-05 12:06:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:19,037 INFO L225 Difference]: With dead ends: 561 [2019-09-05 12:06:19,038 INFO L226 Difference]: Without dead ends: 559 [2019-09-05 12:06:19,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 613 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2510, Invalid=3496, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:06:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-05 12:06:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-05 12:06:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-05 12:06:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2019-09-05 12:06:19,060 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 549 [2019-09-05 12:06:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:19,060 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2019-09-05 12:06:19,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 12:06:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2019-09-05 12:06:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-05 12:06:19,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:19,063 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:19,063 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2028794328, now seen corresponding path program 135 times [2019-09-05 12:06:19,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:19,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:19,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:24,407 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-05 12:06:24,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:24,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 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-05 12:06:24,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:06:24,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-05 12:06:24,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:24,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-05 12:06:24,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:24,938 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-05 12:06:24,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:24,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-05 12:06:24,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-05 12:06:24,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-05 12:06:24,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4971, Invalid=14769, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:06:24,946 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 141 states. [2019-09-05 12:06:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:31,133 INFO L93 Difference]: Finished difference Result 775 states and 845 transitions. [2019-09-05 12:06:31,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-05 12:06:31,134 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 556 [2019-09-05 12:06:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:31,135 INFO L225 Difference]: With dead ends: 775 [2019-09-05 12:06:31,135 INFO L226 Difference]: Without dead ends: 560 [2019-09-05 12:06:31,138 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-05 12:06:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-05 12:06:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-05 12:06:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-05 12:06:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2019-09-05 12:06:31,161 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 556 [2019-09-05 12:06:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:31,161 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2019-09-05 12:06:31,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-05 12:06:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2019-09-05 12:06:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-05 12:06:31,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:31,163 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:31,164 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:31,164 INFO L82 PathProgramCache]: Analyzing trace with hash 459047529, now seen corresponding path program 136 times [2019-09-05 12:06:31,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:31,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:31,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:33,159 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-05 12:06:33,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:33,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 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-05 12:06:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:33,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:33,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:33,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-05 12:06:33,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:33,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:33,679 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-05 12:06:33,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:33,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 76] total 77 [2019-09-05 12:06:33,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 12:06:33,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 12:06:33,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2568, Invalid=3284, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:06:33,684 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 77 states. [2019-09-05 12:06:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:34,617 INFO L93 Difference]: Finished difference Result 569 states and 570 transitions. [2019-09-05 12:06:34,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 12:06:34,618 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 557 [2019-09-05 12:06:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:34,619 INFO L225 Difference]: With dead ends: 569 [2019-09-05 12:06:34,620 INFO L226 Difference]: Without dead ends: 567 [2019-09-05 12:06:34,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 622 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2581, Invalid=3581, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:06:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-05 12:06:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-05 12:06:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-05 12:06:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2019-09-05 12:06:34,644 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 557 [2019-09-05 12:06:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:34,644 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2019-09-05 12:06:34,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 12:06:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2019-09-05 12:06:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-05 12:06:34,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:34,646 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:34,646 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash 206119546, now seen corresponding path program 137 times [2019-09-05 12:06:34,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:34,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:40,050 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-05 12:06:40,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:40,050 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-05 12:06:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:06:40,369 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 70 check-sat command(s) [2019-09-05 12:06:40,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:40,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-05 12:06:40,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:40,529 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-05 12:06:40,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:40,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-05 12:06:40,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-05 12:06:40,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-05 12:06:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5113, Invalid=15193, Unknown=0, NotChecked=0, Total=20306 [2019-09-05 12:06:40,536 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 143 states. [2019-09-05 12:06:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:49,136 INFO L93 Difference]: Finished difference Result 786 states and 857 transitions. [2019-09-05 12:06:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-05 12:06:49,136 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 564 [2019-09-05 12:06:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:49,137 INFO L225 Difference]: With dead ends: 786 [2019-09-05 12:06:49,137 INFO L226 Difference]: Without dead ends: 568 [2019-09-05 12:06:49,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=10367, Invalid=35215, Unknown=0, NotChecked=0, Total=45582 [2019-09-05 12:06:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-05 12:06:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-05 12:06:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-05 12:06:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2019-09-05 12:06:49,163 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 564 [2019-09-05 12:06:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:49,163 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2019-09-05 12:06:49,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-05 12:06:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2019-09-05 12:06:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-05 12:06:49,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:49,166 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:49,166 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1223397899, now seen corresponding path program 138 times [2019-09-05 12:06:49,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:49,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:49,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:51,326 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-05 12:06:51,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:51,326 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-05 12:06:51,336 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:51,686 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 70 check-sat command(s) [2019-09-05 12:06:51,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:51,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-05 12:06:51,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:51,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:51,979 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-05 12:06:51,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:51,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 77] total 78 [2019-09-05 12:06:51,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-05 12:06:51,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-05 12:06:51,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=3366, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:06:51,985 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 78 states. [2019-09-05 12:06:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:52,996 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2019-09-05 12:06:52,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 12:06:52,997 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 565 [2019-09-05 12:06:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:53,000 INFO L225 Difference]: With dead ends: 577 [2019-09-05 12:06:53,000 INFO L226 Difference]: Without dead ends: 575 [2019-09-05 12:06:53,001 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-05 12:06:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-05 12:06:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-09-05 12:06:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-05 12:06:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2019-09-05 12:06:53,037 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 565 [2019-09-05 12:06:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:53,037 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2019-09-05 12:06:53,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-05 12:06:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2019-09-05 12:06:53,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-05 12:06:53,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:53,041 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:53,042 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:53,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:53,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1039767704, now seen corresponding path program 139 times [2019-09-05 12:06:53,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:53,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:53,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:58,650 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-05 12:06:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:58,650 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-05 12:06:58,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:06:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:58,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-05 12:06:58,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:58,999 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-05 12:06:59,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:59,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-05 12:06:59,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-05 12:06:59,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-05 12:06:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=15623, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 12:06:59,006 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 145 states. [2019-09-05 12:07:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:06,961 INFO L93 Difference]: Finished difference Result 797 states and 869 transitions. [2019-09-05 12:07:06,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-05 12:07:06,961 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 572 [2019-09-05 12:07:06,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:06,963 INFO L225 Difference]: With dead ends: 797 [2019-09-05 12:07:06,963 INFO L226 Difference]: Without dead ends: 576 [2019-09-05 12:07:06,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7525 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=10657, Invalid=36215, Unknown=0, NotChecked=0, Total=46872 [2019-09-05 12:07:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-05 12:07:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-05 12:07:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-05 12:07:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 577 transitions. [2019-09-05 12:07:07,000 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 577 transitions. Word has length 572 [2019-09-05 12:07:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:07,001 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 577 transitions. [2019-09-05 12:07:07,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-05 12:07:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 577 transitions. [2019-09-05 12:07:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-05 12:07:07,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:07,004 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:07,005 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:07,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:07,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1602217769, now seen corresponding path program 140 times [2019-09-05 12:07:07,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:07,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:07,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:07,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:07,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:09,145 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-05 12:07:09,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:09,146 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-05 12:07:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:09,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:09,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:09,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-05 12:07:09,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:09,648 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-05 12:07:09,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:09,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 78] total 79 [2019-09-05 12:07:09,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 12:07:09,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 12:07:09,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2713, Invalid=3449, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:07:09,654 INFO L87 Difference]: Start difference. First operand 576 states and 577 transitions. Second operand 79 states. [2019-09-05 12:07:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:10,550 INFO L93 Difference]: Finished difference Result 585 states and 586 transitions. [2019-09-05 12:07:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-05 12:07:10,550 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 573 [2019-09-05 12:07:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:10,552 INFO L225 Difference]: With dead ends: 585 [2019-09-05 12:07:10,552 INFO L226 Difference]: Without dead ends: 583 [2019-09-05 12:07:10,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2726, Invalid=3754, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:07:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-05 12:07:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-05 12:07:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-05 12:07:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2019-09-05 12:07:10,582 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 573 [2019-09-05 12:07:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:10,582 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2019-09-05 12:07:10,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 12:07:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2019-09-05 12:07:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-05 12:07:10,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:10,585 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:10,585 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1227810234, now seen corresponding path program 141 times [2019-09-05 12:07:10,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:10,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:10,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:10,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:10,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:16,261 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-05 12:07:16,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:16,261 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-05 12:07:16,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:07:16,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-09-05 12:07:16,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:16,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-05 12:07:16,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:16,849 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-05 12:07:16,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:16,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-05 12:07:16,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-05 12:07:16,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-05 12:07:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5403, Invalid=16059, Unknown=0, NotChecked=0, Total=21462 [2019-09-05 12:07:16,857 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 147 states. [2019-09-05 12:07:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:22,422 INFO L93 Difference]: Finished difference Result 808 states and 881 transitions. [2019-09-05 12:07:22,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-05 12:07:22,422 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 580 [2019-09-05 12:07:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:22,423 INFO L225 Difference]: With dead ends: 808 [2019-09-05 12:07:22,423 INFO L226 Difference]: Without dead ends: 584 [2019-09-05 12:07:22,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7739 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=10951, Invalid=37229, Unknown=0, NotChecked=0, Total=48180 [2019-09-05 12:07:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-05 12:07:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-05 12:07:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-05 12:07:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 585 transitions. [2019-09-05 12:07:22,452 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 585 transitions. Word has length 580 [2019-09-05 12:07:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:22,452 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 585 transitions. [2019-09-05 12:07:22,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-05 12:07:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 585 transitions. [2019-09-05 12:07:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-09-05 12:07:22,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:22,456 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:22,456 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1498026827, now seen corresponding path program 142 times [2019-09-05 12:07:22,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:22,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:24,611 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-05 12:07:24,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:24,612 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-05 12:07:24,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:24,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:24,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:24,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-05 12:07:24,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:24,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:25,188 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-05 12:07:25,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:25,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 79] total 80 [2019-09-05 12:07:25,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-05 12:07:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-05 12:07:25,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2787, Invalid=3533, Unknown=0, NotChecked=0, Total=6320 [2019-09-05 12:07:25,193 INFO L87 Difference]: Start difference. First operand 584 states and 585 transitions. Second operand 80 states. [2019-09-05 12:07:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:26,218 INFO L93 Difference]: Finished difference Result 593 states and 594 transitions. [2019-09-05 12:07:26,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 12:07:26,219 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 581 [2019-09-05 12:07:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:26,220 INFO L225 Difference]: With dead ends: 593 [2019-09-05 12:07:26,220 INFO L226 Difference]: Without dead ends: 591 [2019-09-05 12:07:26,221 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-05 12:07:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-05 12:07:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-05 12:07:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-05 12:07:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2019-09-05 12:07:26,249 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 581 [2019-09-05 12:07:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:26,249 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2019-09-05 12:07:26,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-05 12:07:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2019-09-05 12:07:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2019-09-05 12:07:26,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:26,252 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:26,252 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash 398667608, now seen corresponding path program 143 times [2019-09-05 12:07:26,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:26,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:26,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:26,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:26,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:32,105 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-05 12:07:32,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:32,105 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-05 12:07:32,115 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:07:32,439 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2019-09-05 12:07:32,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:32,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-05 12:07:32,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:32,613 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-05 12:07:32,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:32,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-05 12:07:32,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-05 12:07:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-05 12:07:32,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5551, Invalid=16501, Unknown=0, NotChecked=0, Total=22052 [2019-09-05 12:07:32,620 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 149 states. [2019-09-05 12:07:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:42,089 INFO L93 Difference]: Finished difference Result 819 states and 893 transitions. [2019-09-05 12:07:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-05 12:07:42,089 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 588 [2019-09-05 12:07:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:42,090 INFO L225 Difference]: With dead ends: 819 [2019-09-05 12:07:42,090 INFO L226 Difference]: Without dead ends: 592 [2019-09-05 12:07:42,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7956 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=11249, Invalid=38257, Unknown=0, NotChecked=0, Total=49506 [2019-09-05 12:07:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-05 12:07:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-05 12:07:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-05 12:07:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 593 transitions. [2019-09-05 12:07:42,130 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 593 transitions. Word has length 588 [2019-09-05 12:07:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:42,130 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 593 transitions. [2019-09-05 12:07:42,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-05 12:07:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 593 transitions. [2019-09-05 12:07:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-09-05 12:07:42,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:42,134 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:42,134 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash -551273495, now seen corresponding path program 144 times [2019-09-05 12:07:42,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:42,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:42,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:42,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:44,360 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-05 12:07:44,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:44,360 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-05 12:07:44,371 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:07:44,724 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-05 12:07:44,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:44,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-05 12:07:44,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:44,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:45,085 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-05 12:07:45,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:45,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 80] total 81 [2019-09-05 12:07:45,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 12:07:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 12:07:45,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=3618, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:07:45,091 INFO L87 Difference]: Start difference. First operand 592 states and 593 transitions. Second operand 81 states. [2019-09-05 12:07:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:46,122 INFO L93 Difference]: Finished difference Result 601 states and 602 transitions. [2019-09-05 12:07:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 12:07:46,123 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 589 [2019-09-05 12:07:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:46,124 INFO L225 Difference]: With dead ends: 601 [2019-09-05 12:07:46,124 INFO L226 Difference]: Without dead ends: 599 [2019-09-05 12:07:46,125 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-05 12:07:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-05 12:07:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-05 12:07:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-05 12:07:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2019-09-05 12:07:46,159 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 589 [2019-09-05 12:07:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:46,159 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 600 transitions. [2019-09-05 12:07:46,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 12:07:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 600 transitions. [2019-09-05 12:07:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-09-05 12:07:46,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:46,162 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:46,162 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1957017850, now seen corresponding path program 145 times [2019-09-05 12:07:46,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:46,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:46,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:52,248 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-05 12:07:52,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:52,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:07:52,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:52,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-05 12:07:52,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:52,616 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-05 12:07:52,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:52,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-05 12:07:52,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-05 12:07:52,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-05 12:07:52,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5701, Invalid=16949, Unknown=0, NotChecked=0, Total=22650 [2019-09-05 12:07:52,622 INFO L87 Difference]: Start difference. First operand 599 states and 600 transitions. Second operand 151 states. [2019-09-05 12:07:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:58,474 INFO L93 Difference]: Finished difference Result 830 states and 905 transitions. [2019-09-05 12:07:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-05 12:07:58,474 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 596 [2019-09-05 12:07:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:58,475 INFO L225 Difference]: With dead ends: 830 [2019-09-05 12:07:58,475 INFO L226 Difference]: Without dead ends: 600 [2019-09-05 12:07:58,477 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-05 12:07:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-05 12:07:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-09-05 12:07:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-05 12:07:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2019-09-05 12:07:58,501 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 596 [2019-09-05 12:07:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:58,502 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 601 transitions. [2019-09-05 12:07:58,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-05 12:07:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 601 transitions. [2019-09-05 12:07:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-09-05 12:07:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:58,504 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:58,504 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2063443083, now seen corresponding path program 146 times [2019-09-05 12:07:58,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:58,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:58,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:58,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:00,768 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-05 12:08:00,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:00,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:08:00,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:08:00,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:08:00,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:00,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-05 12:08:00,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:01,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:01,291 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-05 12:08:01,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:01,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 81] total 82 [2019-09-05 12:08:01,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 12:08:01,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 12:08:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2938, Invalid=3704, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 12:08:01,297 INFO L87 Difference]: Start difference. First operand 600 states and 601 transitions. Second operand 82 states. [2019-09-05 12:08:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:02,319 INFO L93 Difference]: Finished difference Result 609 states and 610 transitions. [2019-09-05 12:08:02,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 12:08:02,319 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 597 [2019-09-05 12:08:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:02,321 INFO L225 Difference]: With dead ends: 609 [2019-09-05 12:08:02,321 INFO L226 Difference]: Without dead ends: 607 [2019-09-05 12:08:02,322 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-05 12:08:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-05 12:08:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-05 12:08:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-05 12:08:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2019-09-05 12:08:02,347 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 597 [2019-09-05 12:08:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:02,347 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2019-09-05 12:08:02,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 12:08:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2019-09-05 12:08:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-09-05 12:08:02,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:02,350 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:02,350 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:02,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1184516584, now seen corresponding path program 147 times [2019-09-05 12:08:02,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:02,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:02,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:02,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:02,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:08,519 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-05 12:08:08,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:08,519 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-05 12:08:08,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:08:08,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-09-05 12:08:08,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:08,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-05 12:08:09,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:09,170 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-05 12:08:09,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:09,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2019-09-05 12:08:09,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-05 12:08:09,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-05 12:08:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5853, Invalid=17403, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:08:09,178 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 153 states. [2019-09-05 12:08:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:17,992 INFO L93 Difference]: Finished difference Result 841 states and 917 transitions. [2019-09-05 12:08:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-05 12:08:17,992 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 604 [2019-09-05 12:08:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:17,994 INFO L225 Difference]: With dead ends: 841 [2019-09-05 12:08:17,994 INFO L226 Difference]: Without dead ends: 608 [2019-09-05 12:08:17,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8399 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=11857, Invalid=40355, Unknown=0, NotChecked=0, Total=52212 [2019-09-05 12:08:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-05 12:08:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-05 12:08:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-05 12:08:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2019-09-05 12:08:18,022 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 604 [2019-09-05 12:08:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:18,023 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2019-09-05 12:08:18,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-05 12:08:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2019-09-05 12:08:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-05 12:08:18,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:18,025 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:18,025 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1164279977, now seen corresponding path program 148 times [2019-09-05 12:08:18,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:18,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:18,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:20,506 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-05 12:08:20,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:20,507 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-05 12:08:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:08:20,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:08:20,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:20,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-05 12:08:20,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:20,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:21,047 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-05 12:08:21,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:21,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 82] total 83 [2019-09-05 12:08:21,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 12:08:21,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 12:08:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3015, Invalid=3791, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:08:21,054 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 83 states. [2019-09-05 12:08:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:22,100 INFO L93 Difference]: Finished difference Result 617 states and 618 transitions. [2019-09-05 12:08:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 12:08:22,100 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 605 [2019-09-05 12:08:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:22,102 INFO L225 Difference]: With dead ends: 617 [2019-09-05 12:08:22,102 INFO L226 Difference]: Without dead ends: 615 [2019-09-05 12:08:22,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 676 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3028, Invalid=4112, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:08:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-09-05 12:08:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-09-05 12:08:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-05 12:08:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2019-09-05 12:08:22,130 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 605 [2019-09-05 12:08:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:22,130 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2019-09-05 12:08:22,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 12:08:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2019-09-05 12:08:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-05 12:08:22,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:22,133 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:22,133 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1813093434, now seen corresponding path program 149 times [2019-09-05 12:08:22,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:22,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:22,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:28,468 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-05 12:08:28,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:28,468 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-05 12:08:28,478 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:08:28,833 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2019-09-05 12:08:28,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:28,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-05 12:08:28,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:29,058 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-05 12:08:29,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:29,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2019-09-05 12:08:29,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-05 12:08:29,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-05 12:08:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6007, Invalid=17863, Unknown=0, NotChecked=0, Total=23870 [2019-09-05 12:08:29,065 INFO L87 Difference]: Start difference. First operand 615 states and 616 transitions. Second operand 155 states. [2019-09-05 12:08:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:39,493 INFO L93 Difference]: Finished difference Result 852 states and 929 transitions. [2019-09-05 12:08:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-05 12:08:39,493 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 612 [2019-09-05 12:08:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:39,494 INFO L225 Difference]: With dead ends: 852 [2019-09-05 12:08:39,494 INFO L226 Difference]: Without dead ends: 616 [2019-09-05 12:08:39,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8625 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12167, Invalid=41425, Unknown=0, NotChecked=0, Total=53592 [2019-09-05 12:08:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-05 12:08:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-09-05 12:08:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-05 12:08:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 617 transitions. [2019-09-05 12:08:39,525 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 617 transitions. Word has length 612 [2019-09-05 12:08:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:39,525 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 617 transitions. [2019-09-05 12:08:39,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-05 12:08:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 617 transitions. [2019-09-05 12:08:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-09-05 12:08:39,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:39,528 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:39,528 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:39,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2090187317, now seen corresponding path program 150 times [2019-09-05 12:08:39,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:39,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:39,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:41,948 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-05 12:08:41,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08: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 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-05 12:08:41,959 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:08:42,338 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 76 check-sat command(s) [2019-09-05 12:08:42,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:42,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-05 12:08:42,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:42,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:42,752 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-05 12:08:42,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:42,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 83] total 84 [2019-09-05 12:08:42,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-05 12:08:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-05 12:08:42,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3093, Invalid=3879, Unknown=0, NotChecked=0, Total=6972 [2019-09-05 12:08:42,758 INFO L87 Difference]: Start difference. First operand 616 states and 617 transitions. Second operand 84 states. [2019-09-05 12:08:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:43,780 INFO L93 Difference]: Finished difference Result 625 states and 626 transitions. [2019-09-05 12:08:43,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 12:08:43,781 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 613 [2019-09-05 12:08:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:43,782 INFO L225 Difference]: With dead ends: 625 [2019-09-05 12:08:43,782 INFO L226 Difference]: Without dead ends: 623 [2019-09-05 12:08:43,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 685 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3106, Invalid=4204, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:08:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-05 12:08:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-05 12:08:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-05 12:08:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2019-09-05 12:08:43,810 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 613 [2019-09-05 12:08:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:43,811 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2019-09-05 12:08:43,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-05 12:08:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2019-09-05 12:08:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-09-05 12:08:43,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:43,813 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:43,813 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash 889007320, now seen corresponding path program 151 times [2019-09-05 12:08:43,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:43,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:43,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:43,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:43,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:50,347 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-05 12:08:50,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:50,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:08:50,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:50,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-05 12:08:50,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:50,734 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-05 12:08:50,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:50,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2019-09-05 12:08:50,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-05 12:08:50,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-05 12:08:50,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6163, Invalid=18329, Unknown=0, NotChecked=0, Total=24492 [2019-09-05 12:08:50,740 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 157 states. [2019-09-05 12:09:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:01,448 INFO L93 Difference]: Finished difference Result 863 states and 941 transitions. [2019-09-05 12:09:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-05 12:09:01,448 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 620 [2019-09-05 12:09:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:01,450 INFO L225 Difference]: With dead ends: 863 [2019-09-05 12:09:01,450 INFO L226 Difference]: Without dead ends: 624 [2019-09-05 12:09:01,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8854 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=12481, Invalid=42509, Unknown=0, NotChecked=0, Total=54990 [2019-09-05 12:09:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-05 12:09:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-09-05 12:09:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-05 12:09:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 625 transitions. [2019-09-05 12:09:01,481 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 625 transitions. Word has length 620 [2019-09-05 12:09:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:01,481 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 625 transitions. [2019-09-05 12:09:01,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-05 12:09:01,482 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 625 transitions. [2019-09-05 12:09:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-09-05 12:09:01,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:01,484 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:01,484 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:01,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:01,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1671449239, now seen corresponding path program 152 times [2019-09-05 12:09:01,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:01,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:01,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:03,982 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-05 12:09:03,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:03,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:09:03,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:09:04,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:09:04,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:04,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-05 12:09:04,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:04,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:04,524 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-05 12:09:04,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:04,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 84] total 85 [2019-09-05 12:09:04,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 12:09:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 12:09:04,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3172, Invalid=3968, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:09:04,529 INFO L87 Difference]: Start difference. First operand 624 states and 625 transitions. Second operand 85 states. [2019-09-05 12:09:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:05,614 INFO L93 Difference]: Finished difference Result 633 states and 634 transitions. [2019-09-05 12:09:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-05 12:09:05,615 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 621 [2019-09-05 12:09:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:05,617 INFO L225 Difference]: With dead ends: 633 [2019-09-05 12:09:05,617 INFO L226 Difference]: Without dead ends: 631 [2019-09-05 12:09:05,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 694 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3185, Invalid=4297, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:09:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-05 12:09:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-09-05 12:09:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-05 12:09:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 632 transitions. [2019-09-05 12:09:05,648 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 632 transitions. Word has length 621 [2019-09-05 12:09:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:05,649 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 632 transitions. [2019-09-05 12:09:05,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 12:09:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 632 transitions. [2019-09-05 12:09:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-09-05 12:09:05,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:05,652 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:05,652 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -841576582, now seen corresponding path program 153 times [2019-09-05 12:09:05,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:05,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:05,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:12,335 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-05 12:09:12,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:12,335 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-05 12:09:12,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:09:12,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-09-05 12:09:12,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:12,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-05 12:09:12,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:13,157 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-05 12:09:13,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:13,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2019-09-05 12:09:13,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-05 12:09:13,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-05 12:09:13,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6321, Invalid=18801, Unknown=0, NotChecked=0, Total=25122 [2019-09-05 12:09:13,164 INFO L87 Difference]: Start difference. First operand 631 states and 632 transitions. Second operand 159 states. [2019-09-05 12:09:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:18,753 INFO L93 Difference]: Finished difference Result 874 states and 953 transitions. [2019-09-05 12:09:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-05 12:09:18,753 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 628 [2019-09-05 12:09:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:18,754 INFO L225 Difference]: With dead ends: 874 [2019-09-05 12:09:18,755 INFO L226 Difference]: Without dead ends: 632 [2019-09-05 12:09:18,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=12799, Invalid=43607, Unknown=0, NotChecked=0, Total=56406 [2019-09-05 12:09:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-05 12:09:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-05 12:09:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-05 12:09:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 633 transitions. [2019-09-05 12:09:18,784 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 633 transitions. Word has length 628 [2019-09-05 12:09:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:18,784 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 633 transitions. [2019-09-05 12:09:18,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-05 12:09:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 633 transitions. [2019-09-05 12:09:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2019-09-05 12:09:18,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:18,787 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:18,787 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:18,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:18,787 INFO L82 PathProgramCache]: Analyzing trace with hash 150206219, now seen corresponding path program 154 times [2019-09-05 12:09:18,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:18,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:18,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:21,365 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-05 12:09:21,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:21,365 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-05 12:09:21,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:09:21,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:09:21,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:21,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-05 12:09:21,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:21,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:21,936 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-05 12:09:21,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:21,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 85] total 86 [2019-09-05 12:09:21,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-05 12:09:21,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-05 12:09:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=4058, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:09:21,942 INFO L87 Difference]: Start difference. First operand 632 states and 633 transitions. Second operand 86 states. [2019-09-05 12:09:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:23,171 INFO L93 Difference]: Finished difference Result 641 states and 642 transitions. [2019-09-05 12:09:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 12:09:23,172 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 629 [2019-09-05 12:09:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:23,173 INFO L225 Difference]: With dead ends: 641 [2019-09-05 12:09:23,174 INFO L226 Difference]: Without dead ends: 639 [2019-09-05 12:09:23,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 703 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3265, Invalid=4391, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:09:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-05 12:09:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-05 12:09:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-05 12:09:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 640 transitions. [2019-09-05 12:09:23,203 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 640 transitions. Word has length 629 [2019-09-05 12:09:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:23,203 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 640 transitions. [2019-09-05 12:09:23,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-05 12:09:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 640 transitions. [2019-09-05 12:09:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-09-05 12:09:23,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:23,206 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:23,206 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:23,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:23,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1146776680, now seen corresponding path program 155 times [2019-09-05 12:09:23,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:23,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:23,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:23,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:23,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:30,007 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-05 12:09:30,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:30,008 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-05 12:09:30,041 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:09:30,444 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2019-09-05 12:09:30,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:30,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-05 12:09:30,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:30,647 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-05 12:09:30,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:30,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2019-09-05 12:09:30,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-05 12:09:30,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-05 12:09:30,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6481, Invalid=19279, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:09:30,655 INFO L87 Difference]: Start difference. First operand 639 states and 640 transitions. Second operand 161 states. [2019-09-05 12:09:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:39,489 INFO L93 Difference]: Finished difference Result 885 states and 965 transitions. [2019-09-05 12:09:39,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-05 12:09:39,489 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 636 [2019-09-05 12:09:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:39,490 INFO L225 Difference]: With dead ends: 885 [2019-09-05 12:09:39,490 INFO L226 Difference]: Without dead ends: 640 [2019-09-05 12:09:39,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9321 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13121, Invalid=44719, Unknown=0, NotChecked=0, Total=57840 [2019-09-05 12:09:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-05 12:09:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-09-05 12:09:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-05 12:09:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 641 transitions. [2019-09-05 12:09:39,522 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 641 transitions. Word has length 636 [2019-09-05 12:09:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:39,522 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 641 transitions. [2019-09-05 12:09:39,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-05 12:09:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 641 transitions. [2019-09-05 12:09:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2019-09-05 12:09:39,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:39,525 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:39,525 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash 221174313, now seen corresponding path program 156 times [2019-09-05 12:09:39,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:39,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:39,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:42,252 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-05 12:09:42,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:42,252 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-05 12:09:42,262 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:09:42,672 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-05 12:09:42,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:42,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-05 12:09:42,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:42,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:43,018 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-05 12:09:43,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:43,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 86] total 87 [2019-09-05 12:09:43,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-05 12:09:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-05 12:09:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3333, Invalid=4149, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:09:43,025 INFO L87 Difference]: Start difference. First operand 640 states and 641 transitions. Second operand 87 states. [2019-09-05 12:09:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:44,531 INFO L93 Difference]: Finished difference Result 649 states and 650 transitions. [2019-09-05 12:09:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-05 12:09:44,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 637 [2019-09-05 12:09:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:44,534 INFO L225 Difference]: With dead ends: 649 [2019-09-05 12:09:44,534 INFO L226 Difference]: Without dead ends: 647 [2019-09-05 12:09:44,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 712 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3346, Invalid=4486, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:09:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-05 12:09:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-05 12:09:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-05 12:09:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 648 transitions. [2019-09-05 12:09:44,564 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 648 transitions. Word has length 637 [2019-09-05 12:09:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:44,565 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 648 transitions. [2019-09-05 12:09:44,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-05 12:09:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 648 transitions. [2019-09-05 12:09:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-09-05 12:09:44,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:44,568 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:44,568 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 962106042, now seen corresponding path program 157 times [2019-09-05 12:09:44,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:44,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:44,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:44,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:44,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:51,597 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-05 12:09:51,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:51,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 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-05 12:09:51,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:51,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-05 12:09:51,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:52,002 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-05 12:09:52,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:52,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2019-09-05 12:09:52,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-05 12:09:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-05 12:09:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6643, Invalid=19763, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:09:52,011 INFO L87 Difference]: Start difference. First operand 647 states and 648 transitions. Second operand 163 states. [2019-09-05 12:09:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:57,417 INFO L93 Difference]: Finished difference Result 896 states and 977 transitions. [2019-09-05 12:09:57,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-05 12:09:57,417 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 644 [2019-09-05 12:09:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:57,418 INFO L225 Difference]: With dead ends: 896 [2019-09-05 12:09:57,418 INFO L226 Difference]: Without dead ends: 648 [2019-09-05 12:09:57,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9559 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13447, Invalid=45845, Unknown=0, NotChecked=0, Total=59292 [2019-09-05 12:09:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-05 12:09:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-09-05 12:09:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-05 12:09:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 649 transitions. [2019-09-05 12:09:57,451 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 649 transitions. Word has length 644 [2019-09-05 12:09:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:57,451 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 649 transitions. [2019-09-05 12:09:57,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-05 12:09:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 649 transitions. [2019-09-05 12:09:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-09-05 12:09:57,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:57,454 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:57,454 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:57,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1560364981, now seen corresponding path program 158 times [2019-09-05 12:09:57,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:57,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:00,093 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-05 12:10:00,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:00,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:10:00,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:10:00,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:10:00,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:00,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-05 12:10:00,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:00,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:00,702 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-05 12:10:00,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:00,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 87] total 88 [2019-09-05 12:10:00,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 12:10:00,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 12:10:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3415, Invalid=4241, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:10:00,707 INFO L87 Difference]: Start difference. First operand 648 states and 649 transitions. Second operand 88 states. [2019-09-05 12:10:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:02,101 INFO L93 Difference]: Finished difference Result 657 states and 658 transitions. [2019-09-05 12:10:02,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 12:10:02,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 645 [2019-09-05 12:10:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:02,103 INFO L225 Difference]: With dead ends: 657 [2019-09-05 12:10:02,103 INFO L226 Difference]: Without dead ends: 655 [2019-09-05 12:10:02,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 721 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3428, Invalid=4582, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:10:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-05 12:10:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-09-05 12:10:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-05 12:10:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2019-09-05 12:10:02,134 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 645 [2019-09-05 12:10:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:02,135 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2019-09-05 12:10:02,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 12:10:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2019-09-05 12:10:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-09-05 12:10:02,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:02,138 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:02,138 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1568336472, now seen corresponding path program 159 times [2019-09-05 12:10:02,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:02,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:02,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:09,373 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-05 12:10:09,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:09,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 12:10:09,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:10:09,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-09-05 12:10:09,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:09,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-05 12:10:09,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:10,098 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-05 12:10:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 165 [2019-09-05 12:10:10,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-05 12:10:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-05 12:10:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6807, Invalid=20253, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:10:10,106 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 165 states. [2019-09-05 12:10:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:18,657 INFO L93 Difference]: Finished difference Result 907 states and 989 transitions. [2019-09-05 12:10:18,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-05 12:10:18,657 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 652 [2019-09-05 12:10:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:18,658 INFO L225 Difference]: With dead ends: 907 [2019-09-05 12:10:18,658 INFO L226 Difference]: Without dead ends: 656 [2019-09-05 12:10:18,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9800 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13777, Invalid=46985, Unknown=0, NotChecked=0, Total=60762 [2019-09-05 12:10:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-05 12:10:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-09-05 12:10:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-05 12:10:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 657 transitions. [2019-09-05 12:10:18,690 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 657 transitions. Word has length 652 [2019-09-05 12:10:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:18,690 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 657 transitions. [2019-09-05 12:10:18,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-05 12:10:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 657 transitions. [2019-09-05 12:10:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-09-05 12:10:18,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:18,694 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:18,694 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:18,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1611731223, now seen corresponding path program 160 times [2019-09-05 12:10:18,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:18,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:18,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:21,384 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-05 12:10:21,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:21,384 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-05 12:10:21,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:10:21,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:10:21,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:21,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-05 12:10:21,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:21,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:21,997 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-05 12:10:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 88] total 89 [2019-09-05 12:10:22,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 12:10:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 12:10:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3498, Invalid=4334, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:10:22,004 INFO L87 Difference]: Start difference. First operand 656 states and 657 transitions. Second operand 89 states. [2019-09-05 12:10:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:23,191 INFO L93 Difference]: Finished difference Result 665 states and 666 transitions. [2019-09-05 12:10:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 12:10:23,191 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 653 [2019-09-05 12:10:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:23,193 INFO L225 Difference]: With dead ends: 665 [2019-09-05 12:10:23,193 INFO L226 Difference]: Without dead ends: 663 [2019-09-05 12:10:23,194 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-05 12:10:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-05 12:10:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-09-05 12:10:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-05 12:10:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 664 transitions. [2019-09-05 12:10:23,265 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 664 transitions. Word has length 653 [2019-09-05 12:10:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:23,265 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 664 transitions. [2019-09-05 12:10:23,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 12:10:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 664 transitions. [2019-09-05 12:10:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2019-09-05 12:10:23,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:23,268 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:23,268 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1896110598, now seen corresponding path program 161 times [2019-09-05 12:10:23,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:23,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:23,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:23,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:23,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:30,669 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-05 12:10:30,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:30,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 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-05 12:10:30,678 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:10:31,082 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2019-09-05 12:10:31,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:31,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-05 12:10:31,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:31,294 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-05 12:10:31,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:31,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 167 [2019-09-05 12:10:31,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-05 12:10:31,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-05 12:10:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6973, Invalid=20749, Unknown=0, NotChecked=0, Total=27722 [2019-09-05 12:10:31,303 INFO L87 Difference]: Start difference. First operand 663 states and 664 transitions. Second operand 167 states. [2019-09-05 12:10:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:40,299 INFO L93 Difference]: Finished difference Result 918 states and 1001 transitions. [2019-09-05 12:10:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-05 12:10:40,300 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 660 [2019-09-05 12:10:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:40,301 INFO L225 Difference]: With dead ends: 918 [2019-09-05 12:10:40,301 INFO L226 Difference]: Without dead ends: 664 [2019-09-05 12:10:40,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10044 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14111, Invalid=48139, Unknown=0, NotChecked=0, Total=62250 [2019-09-05 12:10:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-05 12:10:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2019-09-05 12:10:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-05 12:10:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 665 transitions. [2019-09-05 12:10:40,335 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 665 transitions. Word has length 660 [2019-09-05 12:10:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:40,335 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 665 transitions. [2019-09-05 12:10:40,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-05 12:10:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 665 transitions. [2019-09-05 12:10:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-09-05 12:10:40,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:40,338 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:40,338 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 703498635, now seen corresponding path program 162 times [2019-09-05 12:10:40,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:40,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:43,183 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-05 12:10:43,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:43,184 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-05 12:10:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:43,634 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2019-09-05 12:10:43,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:43,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-05 12:10:43,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:43,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:43,999 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-05 12:10:44,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:44,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 89] total 90 [2019-09-05 12:10:44,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-05 12:10:44,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-05 12:10:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3582, Invalid=4428, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:10:44,007 INFO L87 Difference]: Start difference. First operand 664 states and 665 transitions. Second operand 90 states. [2019-09-05 12:10:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:45,329 INFO L93 Difference]: Finished difference Result 673 states and 674 transitions. [2019-09-05 12:10:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 12:10:45,330 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 661 [2019-09-05 12:10:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:45,332 INFO L225 Difference]: With dead ends: 673 [2019-09-05 12:10:45,332 INFO L226 Difference]: Without dead ends: 671 [2019-09-05 12:10:45,333 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-05 12:10:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-05 12:10:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-09-05 12:10:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-05 12:10:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 672 transitions. [2019-09-05 12:10:45,363 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 672 transitions. Word has length 661 [2019-09-05 12:10:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:45,363 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 672 transitions. [2019-09-05 12:10:45,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-05 12:10:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 672 transitions. [2019-09-05 12:10:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-05 12:10:45,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:45,366 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:45,366 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:45,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash -912707304, now seen corresponding path program 163 times [2019-09-05 12:10:45,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:45,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:45,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:52,912 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-05 12:10:52,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:52,913 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-05 12:10:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:53,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-05 12:10:53,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:53,398 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-05 12:10:53,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:53,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 169 [2019-09-05 12:10:53,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-05 12:10:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-05 12:10:53,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7141, Invalid=21251, Unknown=0, NotChecked=0, Total=28392 [2019-09-05 12:10:53,405 INFO L87 Difference]: Start difference. First operand 671 states and 672 transitions. Second operand 169 states. [2019-09-05 12:11:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:00,186 INFO L93 Difference]: Finished difference Result 929 states and 1013 transitions. [2019-09-05 12:11:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-05 12:11:00,186 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 668 [2019-09-05 12:11:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:00,188 INFO L225 Difference]: With dead ends: 929 [2019-09-05 12:11:00,188 INFO L226 Difference]: Without dead ends: 672 [2019-09-05 12:11:00,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10291 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14449, Invalid=49307, Unknown=0, NotChecked=0, Total=63756 [2019-09-05 12:11:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-05 12:11:00,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2019-09-05 12:11:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-09-05 12:11:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 673 transitions. [2019-09-05 12:11:00,222 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 673 transitions. Word has length 668 [2019-09-05 12:11:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:00,222 INFO L475 AbstractCegarLoop]: Abstraction has 672 states and 673 transitions. [2019-09-05 12:11:00,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-05 12:11:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 673 transitions. [2019-09-05 12:11:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-09-05 12:11:00,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:00,225 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:00,225 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash -71568471, now seen corresponding path program 164 times [2019-09-05 12:11:00,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:00,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:00,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:11:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:03,204 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-05 12:11:03,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:03,205 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-05 12:11:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:11:03,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:11:03,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:03,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-05 12:11:03,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:03,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:03,805 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-05 12:11:03,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 90] total 91 [2019-09-05 12:11:03,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 12:11:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 12:11:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3667, Invalid=4523, Unknown=0, NotChecked=0, Total=8190 [2019-09-05 12:11:03,810 INFO L87 Difference]: Start difference. First operand 672 states and 673 transitions. Second operand 91 states. [2019-09-05 12:11:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:05,040 INFO L93 Difference]: Finished difference Result 681 states and 682 transitions. [2019-09-05 12:11:05,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 12:11:05,041 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 669 [2019-09-05 12:11:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:05,043 INFO L225 Difference]: With dead ends: 681 [2019-09-05 12:11:05,043 INFO L226 Difference]: Without dead ends: 679 [2019-09-05 12:11:05,044 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-05 12:11:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-05 12:11:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2019-09-05 12:11:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-05 12:11:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 680 transitions. [2019-09-05 12:11:05,075 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 680 transitions. Word has length 669 [2019-09-05 12:11:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:05,076 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 680 transitions. [2019-09-05 12:11:05,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 12:11:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 680 transitions. [2019-09-05 12:11:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-09-05 12:11:05,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:05,079 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:05,079 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:05,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash 807651642, now seen corresponding path program 165 times [2019-09-05 12:11:05,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:05,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:05,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:12,951 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-05 12:11:12,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:12,951 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-05 12:11:12,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:11:13,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-05 12:11:13,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:13,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-05 12:11:13,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:13,771 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-05 12:11:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 171 [2019-09-05 12:11:13,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-05 12:11:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-05 12:11:13,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7311, Invalid=21759, Unknown=0, NotChecked=0, Total=29070 [2019-09-05 12:11:13,778 INFO L87 Difference]: Start difference. First operand 679 states and 680 transitions. Second operand 171 states. [2019-09-05 12:11:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:23,313 INFO L93 Difference]: Finished difference Result 940 states and 1025 transitions. [2019-09-05 12:11:23,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-05 12:11:23,313 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 676 [2019-09-05 12:11:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:23,314 INFO L225 Difference]: With dead ends: 940 [2019-09-05 12:11:23,314 INFO L226 Difference]: Without dead ends: 680 [2019-09-05 12:11:23,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10541 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14791, Invalid=50489, Unknown=0, NotChecked=0, Total=65280 [2019-09-05 12:11:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-05 12:11:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2019-09-05 12:11:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-05 12:11:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 681 transitions. [2019-09-05 12:11:23,350 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 681 transitions. Word has length 676 [2019-09-05 12:11:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:23,350 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 681 transitions. [2019-09-05 12:11:23,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-05 12:11:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 681 transitions. [2019-09-05 12:11:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-09-05 12:11:23,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:23,354 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:23,354 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash -148411701, now seen corresponding path program 166 times [2019-09-05 12:11:23,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:23,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:23,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 27723 backedges. 3736 proven. 10375 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2019-09-05 12:11:26,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:26,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:26,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:11:26,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:11:26,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:26,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 179 conjunts are in the unsatisfiable core [2019-09-05 12:11:26,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:26,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 27723 backedges. 3735 proven. 10622 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2019-09-05 12:11:27,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:27,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 91] total 92 [2019-09-05 12:11:27,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 12:11:27,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 12:11:27,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3753, Invalid=4619, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:11:27,081 INFO L87 Difference]: Start difference. First operand 680 states and 681 transitions. Second operand 92 states. [2019-09-05 12:11:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:28,360 INFO L93 Difference]: Finished difference Result 689 states and 690 transitions. [2019-09-05 12:11:28,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 12:11:28,360 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 677 [2019-09-05 12:11:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:28,362 INFO L225 Difference]: With dead ends: 689 [2019-09-05 12:11:28,362 INFO L226 Difference]: Without dead ends: 687 [2019-09-05 12:11:28,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 757 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3766, Invalid=4976, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:11:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-05 12:11:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2019-09-05 12:11:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-09-05 12:11:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 688 transitions. [2019-09-05 12:11:28,395 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 688 transitions. Word has length 677 [2019-09-05 12:11:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:28,395 INFO L475 AbstractCegarLoop]: Abstraction has 687 states and 688 transitions. [2019-09-05 12:11:28,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 12:11:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 688 transitions. [2019-09-05 12:11:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-09-05 12:11:28,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:28,399 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:28,399 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 236742616, now seen corresponding path program 167 times [2019-09-05 12:11:28,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:28,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY